./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:18:06,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:18:06,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:18:06,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:18:06,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:18:06,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:18:06,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:18:06,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:18:06,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:18:06,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:18:06,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:18:06,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:18:06,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:18:06,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:18:06,170 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:18:06,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:18:06,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:18:06,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:18:06,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:18:06,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:18:06,172 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:18:06,174 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:18:06,174 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:18:06,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:18:06,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:18:06,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:18:06,175 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:18:06,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:18:06,175 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:18:06,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:18:06,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:18:06,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:18:06,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:18:06,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:18:06,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:18:06,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:18:06,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:18:06,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:18:06,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:18:06,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:18:06,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:18:06,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:18:06,179 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 -> 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 [2024-11-09 10:18:06,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:18:06,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:18:06,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:18:06,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:18:06,406 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:18:06,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2024-11-09 10:18:07,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:18:08,026 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:18:08,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2024-11-09 10:18:08,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a15c3bf/452ce5383858488093458947278e30db/FLAGab9c02725 [2024-11-09 10:18:08,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a15c3bf/452ce5383858488093458947278e30db [2024-11-09 10:18:08,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:18:08,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:18:08,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:18:08,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:18:08,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:18:08,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:18:08" (1/1) ... [2024-11-09 10:18:08,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7d90cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:08, skipping insertion in model container [2024-11-09 10:18:08,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:18:08" (1/1) ... [2024-11-09 10:18:08,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:18:08,577 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-09 10:18:08,624 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-09 10:18:08,626 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-09 10:18:08,635 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-09 10:18:08,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-09 10:18:08,671 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-09 10:18:08,676 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-09 10:18:08,677 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-09 10:18:08,686 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-09 10:18:08,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-09 10:18:08,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-09 10:18:08,710 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-09 10:18:08,710 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-09 10:18:08,711 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-09 10:18:08,712 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-09 10:18:08,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-09 10:18:08,714 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-09 10:18:08,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-09 10:18:08,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-09 10:18:08,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:18:08,731 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 10:18:08,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@116848f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:08, skipping insertion in model container [2024-11-09 10:18:08,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:18:08,733 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:18:08,734 INFO L158 Benchmark]: Toolchain (without parser) took 676.47ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 123.5MB in the end (delta: -32.5MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-09 10:18:08,734 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:18:08,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.92ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 123.5MB in the end (delta: -32.7MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-09 10:18:08,736 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.92ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 123.5MB in the end (delta: -32.7MB). Peak memory consumption was 17.1MB. 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_SFH_test5-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:18:10,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:18:10,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:18:10,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:18:10,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:18:10,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:18:10,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:18:10,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:18:10,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:18:10,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:18:10,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:18:10,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:18:10,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:18:10,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:18:10,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:18:10,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:18:10,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:18:10,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:18:10,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:18:10,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:18:10,585 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:18:10,585 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:18:10,585 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:18:10,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:18:10,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:18:10,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:18:10,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:18:10,586 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:18:10,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:18:10,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:18:10,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:18:10,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:18:10,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:18:10,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:18:10,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:18:10,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:18:10,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:18:10,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:18:10,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:18:10,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:18:10,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:18:10,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:18:10,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:18:10,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:18:10,590 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 -> 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 [2024-11-09 10:18:10,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:18:10,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:18:10,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:18:10,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:18:10,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:18:10,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2024-11-09 10:18:12,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:18:12,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:18:12,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2024-11-09 10:18:12,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4cf7d3ed/8d959a16daf34462bd5b5cb1e03f2ae3/FLAG18ede4578 [2024-11-09 10:18:12,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4cf7d3ed/8d959a16daf34462bd5b5cb1e03f2ae3 [2024-11-09 10:18:12,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:18:12,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:18:12,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:18:12,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:18:12,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:18:12,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:18:12" (1/1) ... [2024-11-09 10:18:12,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18fd9a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:12, skipping insertion in model container [2024-11-09 10:18:12,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:18:12" (1/1) ... [2024-11-09 10:18:12,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:18:13,068 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-09 10:18:13,090 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-09 10:18:13,093 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-09 10:18:13,096 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-09 10:18:13,102 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-09 10:18:13,136 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-09 10:18:13,141 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-09 10:18:13,145 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-09 10:18:13,149 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-09 10:18:13,173 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-09 10:18:13,174 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-09 10:18:13,175 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-09 10:18:13,176 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-09 10:18:13,177 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-09 10:18:13,178 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-09 10:18:13,179 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-09 10:18:13,180 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-09 10:18:13,181 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-09 10:18:13,188 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-09 10:18:13,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:18:13,209 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:18:13,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:18:13,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-09 10:18:13,240 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:13,241 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-09 10:18:13,243 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-09 10:18:13,245 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-09 10:18:13,261 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-09 10:18:13,262 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-09 10:18:13,277 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-09 10:18:13,280 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-09 10:18:13,293 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-09 10:18:13,293 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-09 10:18:13,294 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-09 10:18:13,294 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-09 10:18:13,296 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-09 10:18:13,297 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-09 10:18:13,297 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-09 10:18:13,298 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-09 10:18:13,298 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-09 10:18:13,301 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-09 10:18:13,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:18:13,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:18:13,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:18:13,403 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:18:13,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13 WrapperNode [2024-11-09 10:18:13,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:18:13,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:18:13,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:18:13,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:18:13,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,511 INFO L138 Inliner]: procedures = 180, calls = 426, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1612 [2024-11-09 10:18:13,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:18:13,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:18:13,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:18:13,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:18:13,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,626 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [2, 24, 371]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 91 writes are split as follows [0, 1, 90]. [2024-11-09 10:18:13,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:18:13,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:18:13,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:18:13,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:18:13,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (1/1) ... [2024-11-09 10:18:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:18:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:18:13,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:18:13,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:18:13,807 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:18:13,808 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:18:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:18:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:18:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 10:18:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:18:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:18:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:18:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:18:13,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:18:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:18:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:18:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:18:13,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:18:13,810 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:18:13,810 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:18:13,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:18:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:18:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:18:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:18:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:18:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:18:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:18:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:18:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:18:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:18:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:18:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:18:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:18:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:18:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:18:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:18:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:18:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:18:14,061 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:18:14,063 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:18:14,083 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:18:14,114 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:18:14,131 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:18:18,164 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2024-11-09 10:18:18,165 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:18:18,205 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:18:18,205 INFO L316 CfgBuilder]: Removed 92 assume(true) statements. [2024-11-09 10:18:18,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:18:18 BoogieIcfgContainer [2024-11-09 10:18:18,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:18:18,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:18:18,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:18:18,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:18:18,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:18:12" (1/3) ... [2024-11-09 10:18:18,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:18:18, skipping insertion in model container [2024-11-09 10:18:18,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:13" (2/3) ... [2024-11-09 10:18:18,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:18:18, skipping insertion in model container [2024-11-09 10:18:18,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:18:18" (3/3) ... [2024-11-09 10:18:18,216 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-2.i [2024-11-09 10:18:18,229 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:18:18,230 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 817 error locations. [2024-11-09 10:18:18,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:18:18,304 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;@702d81a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:18:18,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 817 error locations. [2024-11-09 10:18:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 1644 states, 816 states have (on average 2.221813725490196) internal successors, (1813), 1634 states have internal predecessors, (1813), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:18:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:18:18,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:18,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:18:18,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:18,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-09 10:18:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545302143] [2024-11-09 10:18:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:18,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:18,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:18,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:18,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:18:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:18,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 10:18:18,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:18,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:18,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:18,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545302143] [2024-11-09 10:18:18,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545302143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:18,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:18,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:18:18,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879082689] [2024-11-09 10:18:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:18,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:18:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:18,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:18:18,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:18:18,606 INFO L87 Difference]: Start difference. First operand has 1644 states, 816 states have (on average 2.221813725490196) internal successors, (1813), 1634 states have internal predecessors, (1813), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:18,739 INFO L93 Difference]: Finished difference Result 1624 states and 1717 transitions. [2024-11-09 10:18:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:18:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-09 10:18:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:18,789 INFO L225 Difference]: With dead ends: 1624 [2024-11-09 10:18:18,793 INFO L226 Difference]: Without dead ends: 1622 [2024-11-09 10:18:18,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:18:18,802 INFO L432 NwaCegarLoop]: 1717 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:18,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:18:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-09 10:18:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2024-11-09 10:18:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 806 states have (on average 2.098014888337469) internal successors, (1691), 1612 states have internal predecessors, (1691), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1715 transitions. [2024-11-09 10:18:19,015 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1715 transitions. Word has length 5 [2024-11-09 10:18:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:19,016 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 1715 transitions. [2024-11-09 10:18:19,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1715 transitions. [2024-11-09 10:18:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:18:19,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:19,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:18:19,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:18:19,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:19,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:19,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-09 10:18:19,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:19,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484874381] [2024-11-09 10:18:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:19,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:19,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:19,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:19,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:18:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:19,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:18:19,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:19,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:19,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:19,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:19,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484874381] [2024-11-09 10:18:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484874381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:19,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:19,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:18:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36118042] [2024-11-09 10:18:19,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:19,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:19,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:19,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:19,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:19,394 INFO L87 Difference]: Start difference. First operand 1622 states and 1715 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:21,696 INFO L93 Difference]: Finished difference Result 1758 states and 1883 transitions. [2024-11-09 10:18:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:21,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 10:18:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:21,704 INFO L225 Difference]: With dead ends: 1758 [2024-11-09 10:18:21,704 INFO L226 Difference]: Without dead ends: 1758 [2024-11-09 10:18:21,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 10:18:21,706 INFO L432 NwaCegarLoop]: 1181 mSDtfsCounter, 1264 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:21,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 1463 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:18:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-11-09 10:18:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1530. [2024-11-09 10:18:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 806 states have (on average 1.9838709677419355) internal successors, (1599), 1520 states have internal predecessors, (1599), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1623 transitions. [2024-11-09 10:18:21,732 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1623 transitions. Word has length 5 [2024-11-09 10:18:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:21,732 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 1623 transitions. [2024-11-09 10:18:21,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1623 transitions. [2024-11-09 10:18:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:18:21,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:21,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:18:21,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:18:21,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:21,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:21,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-09 10:18:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074442800] [2024-11-09 10:18:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:21,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:21,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:21,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:21,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:18:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:22,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:18:22,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:22,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:18:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:22,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:22,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:22,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074442800] [2024-11-09 10:18:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074442800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:22,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:22,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:18:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58893178] [2024-11-09 10:18:22,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:22,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:22,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:22,072 INFO L87 Difference]: Start difference. First operand 1530 states and 1623 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:24,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:24,924 INFO L93 Difference]: Finished difference Result 2076 states and 2220 transitions. [2024-11-09 10:18:24,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:24,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 10:18:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:24,929 INFO L225 Difference]: With dead ends: 2076 [2024-11-09 10:18:24,930 INFO L226 Difference]: Without dead ends: 2076 [2024-11-09 10:18:24,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 10:18:24,931 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 768 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:24,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2255 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 10:18:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2024-11-09 10:18:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 1697. [2024-11-09 10:18:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 983 states have (on average 1.9521871820956256) internal successors, (1919), 1687 states have internal predecessors, (1919), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1943 transitions. [2024-11-09 10:18:24,963 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 1943 transitions. Word has length 5 [2024-11-09 10:18:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:24,963 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 1943 transitions. [2024-11-09 10:18:24,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 1943 transitions. [2024-11-09 10:18:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:18:24,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:24,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:18:24,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:18:25,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:25,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:25,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1956327503, now seen corresponding path program 1 times [2024-11-09 10:18:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664002846] [2024-11-09 10:18:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:25,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:25,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:25,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:25,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:18:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:25,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:18:25,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:25,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:25,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664002846] [2024-11-09 10:18:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664002846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:25,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:25,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908099232] [2024-11-09 10:18:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:25,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:25,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:25,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:25,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:25,321 INFO L87 Difference]: Start difference. First operand 1697 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 2.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-09 10:18:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:25,544 INFO L93 Difference]: Finished difference Result 3174 states and 3655 transitions. [2024-11-09 10:18:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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-09 10:18:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:25,559 INFO L225 Difference]: With dead ends: 3174 [2024-11-09 10:18:25,559 INFO L226 Difference]: Without dead ends: 3174 [2024-11-09 10:18:25,559 INFO L431 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-09 10:18:25,561 INFO L432 NwaCegarLoop]: 1880 mSDtfsCounter, 1357 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:25,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 3483 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:18:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2024-11-09 10:18:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 1699. [2024-11-09 10:18:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 985 states have (on average 1.950253807106599) internal successors, (1921), 1689 states have internal predecessors, (1921), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 1945 transitions. [2024-11-09 10:18:25,604 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 1945 transitions. Word has length 6 [2024-11-09 10:18:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:25,604 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 1945 transitions. [2024-11-09 10:18:25,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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-09 10:18:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 1945 transitions. [2024-11-09 10:18:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:18:25,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:25,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:25,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:18:25,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:25,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:25,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-09 10:18:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:25,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854795529] [2024-11-09 10:18:25,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:25,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:25,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:25,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:25,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:18:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:25,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:18:25,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:25,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:25,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854795529] [2024-11-09 10:18:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854795529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:25,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:25,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:25,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274682745] [2024-11-09 10:18:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:25,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:25,983 INFO L87 Difference]: Start difference. First operand 1699 states and 1945 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:26,012 INFO L93 Difference]: Finished difference Result 1657 states and 1902 transitions. [2024-11-09 10:18:26,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:26,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 10:18:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:26,017 INFO L225 Difference]: With dead ends: 1657 [2024-11-09 10:18:26,017 INFO L226 Difference]: Without dead ends: 1657 [2024-11-09 10:18:26,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:26,018 INFO L432 NwaCegarLoop]: 1558 mSDtfsCounter, 71 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3053 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-09 10:18:26,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3053 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:18:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-09 10:18:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2024-11-09 10:18:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 967 states have (on average 1.9420889348500516) internal successors, (1878), 1647 states have internal predecessors, (1878), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 1902 transitions. [2024-11-09 10:18:26,041 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 1902 transitions. Word has length 11 [2024-11-09 10:18:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:26,041 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 1902 transitions. [2024-11-09 10:18:26,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 1902 transitions. [2024-11-09 10:18:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:18:26,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:26,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:26,046 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-09 10:18:26,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:26,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:26,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1407004526, now seen corresponding path program 1 times [2024-11-09 10:18:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205979113] [2024-11-09 10:18:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:26,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:26,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:26,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:26,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:18:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:26,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:18:26,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:26,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:26,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:26,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205979113] [2024-11-09 10:18:26,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205979113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:26,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:26,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088694995] [2024-11-09 10:18:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:26,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:26,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:26,440 INFO L87 Difference]: Start difference. First operand 1657 states and 1902 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:26,530 INFO L93 Difference]: Finished difference Result 1635 states and 1873 transitions. [2024-11-09 10:18:26,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:18:26,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:18:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:26,534 INFO L225 Difference]: With dead ends: 1635 [2024-11-09 10:18:26,534 INFO L226 Difference]: Without dead ends: 1635 [2024-11-09 10:18:26,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-09 10:18:26,535 INFO L432 NwaCegarLoop]: 1513 mSDtfsCounter, 48 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4513 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:26,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4513 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:18:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-09 10:18:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2024-11-09 10:18:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 959 states have (on average 1.9280500521376434) internal successors, (1849), 1625 states have internal predecessors, (1849), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1873 transitions. [2024-11-09 10:18:26,556 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1873 transitions. Word has length 13 [2024-11-09 10:18:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:26,556 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 1873 transitions. [2024-11-09 10:18:26,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1873 transitions. [2024-11-09 10:18:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 10:18:26,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:26,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:26,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:18:26,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:26,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:26,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1466507840, now seen corresponding path program 1 times [2024-11-09 10:18:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298086344] [2024-11-09 10:18:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:26,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:26,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:26,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:18:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:26,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:18:26,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:26,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:26,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:26,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298086344] [2024-11-09 10:18:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298086344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:26,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:26,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:26,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487442311] [2024-11-09 10:18:26,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:26,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:26,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:26,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:26,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:26,958 INFO L87 Difference]: Start difference. First operand 1635 states and 1873 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:29,266 INFO L93 Difference]: Finished difference Result 1635 states and 1873 transitions. [2024-11-09 10:18:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:18:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-09 10:18:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:29,270 INFO L225 Difference]: With dead ends: 1635 [2024-11-09 10:18:29,270 INFO L226 Difference]: Without dead ends: 1635 [2024-11-09 10:18:29,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-09 10:18:29,271 INFO L432 NwaCegarLoop]: 880 mSDtfsCounter, 1201 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:29,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1708 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:18:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-09 10:18:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1631. [2024-11-09 10:18:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 959 states have (on average 1.9238790406673618) internal successors, (1845), 1621 states have internal predecessors, (1845), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 1869 transitions. [2024-11-09 10:18:29,293 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 1869 transitions. Word has length 27 [2024-11-09 10:18:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:29,294 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 1869 transitions. [2024-11-09 10:18:29,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1869 transitions. [2024-11-09 10:18:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 10:18:29,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:29,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:29,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:18:29,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:29,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:29,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1466507841, now seen corresponding path program 1 times [2024-11-09 10:18:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136615050] [2024-11-09 10:18:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:29,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:29,502 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:29,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:18:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:29,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:18:29,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:29,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:18:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:29,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:29,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:29,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136615050] [2024-11-09 10:18:29,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136615050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:29,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:29,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:29,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575127403] [2024-11-09 10:18:29,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:29,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:29,926 INFO L87 Difference]: Start difference. First operand 1631 states and 1869 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:33,077 INFO L93 Difference]: Finished difference Result 2011 states and 2147 transitions. [2024-11-09 10:18:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:18:33,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-09 10:18:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:33,082 INFO L225 Difference]: With dead ends: 2011 [2024-11-09 10:18:33,082 INFO L226 Difference]: Without dead ends: 2011 [2024-11-09 10:18:33,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-09 10:18:33,083 INFO L432 NwaCegarLoop]: 1242 mSDtfsCounter, 701 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:33,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2687 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 10:18:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2024-11-09 10:18:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1627. [2024-11-09 10:18:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 959 states have (on average 1.9197080291970803) internal successors, (1841), 1617 states have internal predecessors, (1841), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1865 transitions. [2024-11-09 10:18:33,103 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1865 transitions. Word has length 27 [2024-11-09 10:18:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:33,104 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 1865 transitions. [2024-11-09 10:18:33,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1865 transitions. [2024-11-09 10:18:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 10:18:33,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:33,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:33,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 10:18:33,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:33,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:33,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash 240316858, now seen corresponding path program 1 times [2024-11-09 10:18:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:33,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931983350] [2024-11-09 10:18:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:33,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:33,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:33,310 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:33,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:18:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:33,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:18:33,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:33,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:33,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:33,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931983350] [2024-11-09 10:18:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931983350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:33,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:33,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695092196] [2024-11-09 10:18:33,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:33,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:33,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:33,503 INFO L87 Difference]: Start difference. First operand 1627 states and 1865 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:33,546 INFO L93 Difference]: Finished difference Result 1621 states and 1855 transitions. [2024-11-09 10:18:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:18:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2024-11-09 10:18:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:33,550 INFO L225 Difference]: With dead ends: 1621 [2024-11-09 10:18:33,550 INFO L226 Difference]: Without dead ends: 1621 [2024-11-09 10:18:33,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-09 10:18:33,550 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 21 mSDsluCounter, 2983 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4490 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-09 10:18:33,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4490 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:18:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2024-11-09 10:18:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2024-11-09 10:18:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 953 states have (on average 1.9213011542497376) internal successors, (1831), 1611 states have internal predecessors, (1831), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1855 transitions. [2024-11-09 10:18:33,573 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1855 transitions. Word has length 43 [2024-11-09 10:18:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:33,573 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 1855 transitions. [2024-11-09 10:18:33,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1855 transitions. [2024-11-09 10:18:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 10:18:33,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:33,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:33,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:33,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:33,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:33,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1088353786, now seen corresponding path program 1 times [2024-11-09 10:18:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:33,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069934968] [2024-11-09 10:18:33,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:33,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:33,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:33,784 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:33,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 10:18:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:33,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:18:33,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:34,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:34,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:34,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069934968] [2024-11-09 10:18:34,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069934968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:34,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:34,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146296436] [2024-11-09 10:18:34,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:34,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:34,170 INFO L87 Difference]: Start difference. First operand 1621 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:34,321 INFO L93 Difference]: Finished difference Result 1839 states and 2102 transitions. [2024-11-09 10:18:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2024-11-09 10:18:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:34,326 INFO L225 Difference]: With dead ends: 1839 [2024-11-09 10:18:34,327 INFO L226 Difference]: Without dead ends: 1839 [2024-11-09 10:18:34,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-09 10:18:34,327 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 178 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:34,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 3051 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:18:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-09 10:18:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1668. [2024-11-09 10:18:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1000 states have (on average 1.878) internal successors, (1878), 1658 states have internal predecessors, (1878), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 1902 transitions. [2024-11-09 10:18:34,348 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 1902 transitions. Word has length 51 [2024-11-09 10:18:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:34,348 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 1902 transitions. [2024-11-09 10:18:34,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1902 transitions. [2024-11-09 10:18:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 10:18:34,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:34,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:34,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:34,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:34,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:34,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash -546976181, now seen corresponding path program 1 times [2024-11-09 10:18:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4774163] [2024-11-09 10:18:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:34,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:34,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:34,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 10:18:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:34,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:18:34,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:34,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:34,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:18:35,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:18:35,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:18:35,273 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:18:35,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:18:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:35,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:35,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:35,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4774163] [2024-11-09 10:18:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4774163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:35,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140548312] [2024-11-09 10:18:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:35,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:35,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:35,290 INFO L87 Difference]: Start difference. First operand 1668 states and 1902 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:37,303 INFO L93 Difference]: Finished difference Result 1584 states and 1818 transitions. [2024-11-09 10:18:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:18:37,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-11-09 10:18:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:37,310 INFO L225 Difference]: With dead ends: 1584 [2024-11-09 10:18:37,310 INFO L226 Difference]: Without dead ends: 1584 [2024-11-09 10:18:37,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-09 10:18:37,311 INFO L432 NwaCegarLoop]: 638 mSDtfsCounter, 1128 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:37,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 820 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:18:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-09 10:18:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1407. [2024-11-09 10:18:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 823 states have (on average 1.778857837181045) internal successors, (1464), 1397 states have internal predecessors, (1464), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1488 transitions. [2024-11-09 10:18:37,351 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1488 transitions. Word has length 54 [2024-11-09 10:18:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:37,351 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1488 transitions. [2024-11-09 10:18:37,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1488 transitions. [2024-11-09 10:18:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 10:18:37,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:37,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:37,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:37,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:37,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:37,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:37,554 INFO L85 PathProgramCache]: Analyzing trace with hash 206433881, now seen corresponding path program 1 times [2024-11-09 10:18:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:37,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143776502] [2024-11-09 10:18:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:37,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:37,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:37,558 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:37,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 10:18:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:37,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:18:37,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:37,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:37,804 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-09 10:18:37,826 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-09 10:18:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:37,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:37,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:37,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143776502] [2024-11-09 10:18:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143776502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:37,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:37,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:37,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652050091] [2024-11-09 10:18:37,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:37,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:18:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:37,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:18:37,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:37,835 INFO L87 Difference]: Start difference. First operand 1407 states and 1488 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:40,127 INFO L93 Difference]: Finished difference Result 1406 states and 1487 transitions. [2024-11-09 10:18:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:18:40,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-09 10:18:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:40,134 INFO L225 Difference]: With dead ends: 1406 [2024-11-09 10:18:40,135 INFO L226 Difference]: Without dead ends: 1406 [2024-11-09 10:18:40,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-09 10:18:40,135 INFO L432 NwaCegarLoop]: 1434 mSDtfsCounter, 2 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3707 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:40,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3707 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:18:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-11-09 10:18:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2024-11-09 10:18:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 823 states have (on average 1.7776427703523694) internal successors, (1463), 1396 states have internal predecessors, (1463), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1487 transitions. [2024-11-09 10:18:40,166 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1487 transitions. Word has length 59 [2024-11-09 10:18:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:40,166 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 1487 transitions. [2024-11-09 10:18:40,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1487 transitions. [2024-11-09 10:18:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 10:18:40,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:40,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:40,181 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 (13)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:40,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:40,372 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:40,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:40,372 INFO L85 PathProgramCache]: Analyzing trace with hash 206433882, now seen corresponding path program 1 times [2024-11-09 10:18:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564862853] [2024-11-09 10:18:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:40,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:40,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:40,378 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:40,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 10:18:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:40,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:18:40,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:40,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:18:40,606 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-09 10:18:40,614 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-09 10:18:40,641 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-09 10:18:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:40,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:40,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564862853] [2024-11-09 10:18:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564862853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701380085] [2024-11-09 10:18:40,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:40,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:18:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:40,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:18:40,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:40,654 INFO L87 Difference]: Start difference. First operand 1406 states and 1487 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:43,492 INFO L93 Difference]: Finished difference Result 1405 states and 1486 transitions. [2024-11-09 10:18:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:18:43,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-09 10:18:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:43,495 INFO L225 Difference]: With dead ends: 1405 [2024-11-09 10:18:43,496 INFO L226 Difference]: Without dead ends: 1405 [2024-11-09 10:18:43,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-09 10:18:43,500 INFO L432 NwaCegarLoop]: 1434 mSDtfsCounter, 1 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:43,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3745 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 10:18:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-09 10:18:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-09 10:18:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 822 states have (on average 1.778588807785888) internal successors, (1462), 1395 states have internal predecessors, (1462), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:18:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1486 transitions. [2024-11-09 10:18:43,528 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1486 transitions. Word has length 59 [2024-11-09 10:18:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:43,528 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1486 transitions. [2024-11-09 10:18:43,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1486 transitions. [2024-11-09 10:18:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 10:18:43,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:43,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:43,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 10:18:43,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:43,730 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:43,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash -956357056, now seen corresponding path program 1 times [2024-11-09 10:18:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671356548] [2024-11-09 10:18:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:43,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:43,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:43,734 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:43,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:18:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:43,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:18:43,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:43,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:43,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671356548] [2024-11-09 10:18:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671356548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412388641] [2024-11-09 10:18:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:43,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:43,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:43,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:43,983 INFO L87 Difference]: Start difference. First operand 1405 states and 1486 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-09 10:18:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:44,020 INFO L93 Difference]: Finished difference Result 1408 states and 1491 transitions. [2024-11-09 10:18:44,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:18:44,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67 [2024-11-09 10:18:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:44,024 INFO L225 Difference]: With dead ends: 1408 [2024-11-09 10:18:44,024 INFO L226 Difference]: Without dead ends: 1408 [2024-11-09 10:18:44,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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-09 10:18:44,025 INFO L432 NwaCegarLoop]: 1433 mSDtfsCounter, 0 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4291 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-09 10:18:44,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4291 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:18:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-09 10:18:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1408. [2024-11-09 10:18:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 824 states have (on average 1.7779126213592233) internal successors, (1465), 1398 states have internal predecessors, (1465), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 10:18:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1491 transitions. [2024-11-09 10:18:44,039 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1491 transitions. Word has length 67 [2024-11-09 10:18:44,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:44,040 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1491 transitions. [2024-11-09 10:18:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-09 10:18:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1491 transitions. [2024-11-09 10:18:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 10:18:44,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:44,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:44,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 10:18:44,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:44,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:44,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:44,244 INFO L85 PathProgramCache]: Analyzing trace with hash 641013744, now seen corresponding path program 1 times [2024-11-09 10:18:44,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:44,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377558498] [2024-11-09 10:18:44,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:44,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:44,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:44,246 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:44,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 10:18:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:44,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:18:44,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:44,502 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-09 10:18:44,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:18:44,556 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-09 10:18:44,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377558498] [2024-11-09 10:18:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377558498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:18:44,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:18:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 10:18:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258531134] [2024-11-09 10:18:44,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:18:44,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:18:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:18:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:18:44,558 INFO L87 Difference]: Start difference. First operand 1408 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-09 10:18:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:44,731 INFO L93 Difference]: Finished difference Result 1420 states and 1509 transitions. [2024-11-09 10:18:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:18:44,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 68 [2024-11-09 10:18:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:44,739 INFO L225 Difference]: With dead ends: 1420 [2024-11-09 10:18:44,739 INFO L226 Difference]: Without dead ends: 1420 [2024-11-09 10:18:44,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 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-09 10:18:44,740 INFO L432 NwaCegarLoop]: 1432 mSDtfsCounter, 5 mSDsluCounter, 8555 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9987 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:44,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9987 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:18:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-09 10:18:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1418. [2024-11-09 10:18:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 833 states have (on average 1.7767106842737095) internal successors, (1480), 1407 states have internal predecessors, (1480), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 10:18:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1506 transitions. [2024-11-09 10:18:44,775 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1506 transitions. Word has length 68 [2024-11-09 10:18:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 1506 transitions. [2024-11-09 10:18:44,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-09 10:18:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1506 transitions. [2024-11-09 10:18:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 10:18:44,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:44,776 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:44,787 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-09 10:18:44,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:44,977 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash -574221760, now seen corresponding path program 2 times [2024-11-09 10:18:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:44,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816015751] [2024-11-09 10:18:44,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:18:44,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:44,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:44,983 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:44,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 10:18:45,361 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:18:45,361 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:18:45,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:18:45,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:45,427 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-09 10:18:45,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:18:45,572 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-09 10:18:45,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816015751] [2024-11-09 10:18:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816015751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:18:45,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:18:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 10:18:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881458397] [2024-11-09 10:18:45,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:18:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:18:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:18:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:18:45,574 INFO L87 Difference]: Start difference. First operand 1418 states and 1506 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-09 10:18:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:45,973 INFO L93 Difference]: Finished difference Result 1433 states and 1527 transitions. [2024-11-09 10:18:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:18:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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 71 [2024-11-09 10:18:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:45,977 INFO L225 Difference]: With dead ends: 1433 [2024-11-09 10:18:45,977 INFO L226 Difference]: Without dead ends: 1427 [2024-11-09 10:18:45,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 10:18:45,978 INFO L432 NwaCegarLoop]: 1433 mSDtfsCounter, 12 mSDsluCounter, 9992 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11425 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-09 10:18:45,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 11425 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:18:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-09 10:18:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2024-11-09 10:18:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 842 states have (on average 1.7707838479809976) internal successors, (1491), 1416 states have internal predecessors, (1491), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 10:18:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1517 transitions. [2024-11-09 10:18:45,999 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1517 transitions. Word has length 71 [2024-11-09 10:18:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:45,999 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1517 transitions. [2024-11-09 10:18:45,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-09 10:18:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1517 transitions. [2024-11-09 10:18:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 10:18:46,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:46,001 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:46,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 10:18:46,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:46,202 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:46,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash -681626560, now seen corresponding path program 3 times [2024-11-09 10:18:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:46,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920720503] [2024-11-09 10:18:46,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:18:46,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:46,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:46,204 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:46,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 10:18:46,797 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:18:46,797 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:18:46,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:18:46,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:46,938 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-09 10:18:46,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:18:47,386 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-09 10:18:47,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920720503] [2024-11-09 10:18:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920720503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:18:47,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:18:47,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 10:18:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825959581] [2024-11-09 10:18:47,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:18:47,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:18:47,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:47,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:18:47,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:18:47,389 INFO L87 Difference]: Start difference. First operand 1427 states and 1517 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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-09 10:18:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:48,686 INFO L93 Difference]: Finished difference Result 1451 states and 1556 transitions. [2024-11-09 10:18:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 10:18:48,686 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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 77 [2024-11-09 10:18:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:48,689 INFO L225 Difference]: With dead ends: 1451 [2024-11-09 10:18:48,690 INFO L226 Difference]: Without dead ends: 1445 [2024-11-09 10:18:48,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 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-09 10:18:48,691 INFO L432 NwaCegarLoop]: 1433 mSDtfsCounter, 16 mSDsluCounter, 18566 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 19999 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:48,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 19999 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:18:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-09 10:18:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2024-11-09 10:18:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 860 states have (on average 1.7604651162790699) internal successors, (1514), 1434 states have internal predecessors, (1514), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 10:18:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1540 transitions. [2024-11-09 10:18:48,706 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1540 transitions. Word has length 77 [2024-11-09 10:18:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:48,706 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1540 transitions. [2024-11-09 10:18:48,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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-09 10:18:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1540 transitions. [2024-11-09 10:18:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:18:48,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:48,707 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:48,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:48,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:48,912 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:48,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash -787679168, now seen corresponding path program 4 times [2024-11-09 10:18:48,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:48,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917085425] [2024-11-09 10:18:48,913 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:18:48,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:48,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:48,915 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:48,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 10:18:49,316 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:18:49,317 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:18:49,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:18:49,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:49,646 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-09 10:18:49,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:18:50,791 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-09 10:18:50,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917085425] [2024-11-09 10:18:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917085425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:18:50,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:18:50,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 10:18:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395131373] [2024-11-09 10:18:50,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:18:50,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 10:18:50,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:50,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 10:18:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 10:18:50,794 INFO L87 Difference]: Start difference. First operand 1445 states and 1540 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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-09 10:18:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:55,252 INFO L93 Difference]: Finished difference Result 1485 states and 1613 transitions. [2024-11-09 10:18:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 10:18:55,252 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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 89 [2024-11-09 10:18:55,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:55,255 INFO L225 Difference]: With dead ends: 1485 [2024-11-09 10:18:55,256 INFO L226 Difference]: Without dead ends: 1481 [2024-11-09 10:18:55,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 10:18:55,258 INFO L432 NwaCegarLoop]: 1432 mSDtfsCounter, 43 mSDsluCounter, 37123 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38555 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:55,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 38555 Invalid, 2130 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [94 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:18:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2024-11-09 10:18:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2024-11-09 10:18:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 894 states have (on average 1.74496644295302) internal successors, (1560), 1468 states have internal predecessors, (1560), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 10:18:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1586 transitions. [2024-11-09 10:18:55,272 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1586 transitions. Word has length 89 [2024-11-09 10:18:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:55,273 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 1586 transitions. [2024-11-09 10:18:55,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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-09 10:18:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1586 transitions. [2024-11-09 10:18:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 10:18:55,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:55,274 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:55,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:55,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:55,474 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-09 10:18:55,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash -753841600, now seen corresponding path program 5 times [2024-11-09 10:18:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:55,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000245356] [2024-11-09 10:18:55,475 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:18:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:55,477 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:55,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 10:18:56,551 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:18:56,552 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:18:56,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 10:18:56,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:56,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:56,664 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 10:18:56,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 10:18:56,683 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-09 10:18:56,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 10:18:57,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:18:57,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 10:18:57,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 10:18:57,531 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-09 10:18:57,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:18:57,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1686) |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-09 10:18:57,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:57,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000245356] [2024-11-09 10:18:57,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000245356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:18:57,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [947077043] [2024-11-09 10:18:57,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:18:57,811 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:18:57,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:18:57,813 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:18:57,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process