./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.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/ldv-memsafety/memleaks_test23_4.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 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:52:24,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:52:24,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:52:24,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:52:24,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:52:24,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:52:24,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:52:24,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:52:24,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:52:24,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:52:24,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:52:24,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:52:24,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:52:24,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:52:24,430 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:52:24,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:52:24,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:52:24,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:52:24,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:52:24,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:52:24,432 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:52:24,435 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:52:24,436 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:52:24,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:52:24,436 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:52:24,436 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:52:24,437 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:52:24,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:52:24,437 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:52:24,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:52:24,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:52:24,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:52:24,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:52:24,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:24,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:52:24,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:52:24,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:52:24,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:52:24,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:52:24,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:52:24,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:52:24,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:52:24,443 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 -> 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 [2024-11-09 07:52:24,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:52:24,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:52:24,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:52:24,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:52:24,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:52:24,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2024-11-09 07:52:26,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:52:26,556 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:52:26,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2024-11-09 07:52:26,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82b099b7/4de81167188144ed83e163f7280b4499/FLAGfa9fec084 [2024-11-09 07:52:26,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82b099b7/4de81167188144ed83e163f7280b4499 [2024-11-09 07:52:26,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:52:26,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:52:26,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:26,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:52:26,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:52:26,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:26" (1/1) ... [2024-11-09 07:52:26,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124fb194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:26, skipping insertion in model container [2024-11-09 07:52:26,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:26" (1/1) ... [2024-11-09 07:52:26,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:27,333 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 07:52:27,446 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 07:52:27,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:27,482 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 07:52:27,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6577645e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:27, skipping insertion in model container [2024-11-09 07:52:27,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:27,483 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:52:27,485 INFO L158 Benchmark]: Toolchain (without parser) took 612.77ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 87.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:52:27,486 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 161.5MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:52:27,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.01ms. Allocated memory is still 161.5MB. Free memory was 104.5MB in the beginning and 87.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:52:27,489 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.24ms. Allocated memory is still 161.5MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 610.01ms. Allocated memory is still 161.5MB. Free memory was 104.5MB in the beginning and 87.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test23_4.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 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:52:29,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:52:29,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:52:29,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:52:29,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:52:29,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:52:29,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:52:29,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:52:29,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:52:29,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:52:29,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:52:29,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:52:29,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:52:29,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:52:29,735 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:52:29,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:52:29,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:52:29,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:52:29,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:52:29,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:52:29,742 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:52:29,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:52:29,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:52:29,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:52:29,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:52:29,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:52:29,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:52:29,745 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:52:29,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:52:29,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:52:29,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:52:29,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:52:29,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:52:29,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:52:29,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:52:29,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:29,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:52:29,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:52:29,749 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:52:29,749 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:52:29,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:52:29,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:52:29,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:52:29,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:52:29,750 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 -> 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 [2024-11-09 07:52:30,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:52:30,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:52:30,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:52:30,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:52:30,153 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:52:30,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2024-11-09 07:52:31,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:52:32,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:52:32,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2024-11-09 07:52:32,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c509dcb5/642a0594c4884f709b7036a47bc4d3f5/FLAGffcab0243 [2024-11-09 07:52:32,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c509dcb5/642a0594c4884f709b7036a47bc4d3f5 [2024-11-09 07:52:32,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:52:32,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:52:32,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:32,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:52:32,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:52:32,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:32" (1/1) ... [2024-11-09 07:52:32,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ae8d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:32, skipping insertion in model container [2024-11-09 07:52:32,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:32" (1/1) ... [2024-11-09 07:52:32,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:32,779 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 07:52:32,859 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 07:52:32,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:32,888 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:52:32,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:32,922 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 07:52:32,961 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 07:52:32,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:32,979 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:52:33,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:33,090 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:52:33,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33 WrapperNode [2024-11-09 07:52:33,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:33,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:52:33,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:52:33,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:52:33,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,156 INFO L138 Inliner]: procedures = 174, calls = 117, calls flagged for inlining = 29, calls inlined = 14, statements flattened = 189 [2024-11-09 07:52:33,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:52:33,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:52:33,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:52:33,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:52:33,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,215 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 4, 29]. 83 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 17 writes are split as follows [0, 4, 13]. [2024-11-09 07:52:33,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:52:33,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:52:33,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:52:33,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:52:33,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (1/1) ... [2024-11-09 07:52:33,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:33,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:52:33,286 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 07:52:33,288 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 07:52:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:52:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:52:33,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:52:33,328 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:52:33,328 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:52:33,328 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-09 07:52:33,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-09 07:52:33,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:52:33,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:52:33,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:52:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:52:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2024-11-09 07:52:33,329 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2024-11-09 07:52:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:52:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:52:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:52:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:52:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:52:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:52:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-09 07:52:33,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-09 07:52:33,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-09 07:52:33,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-09 07:52:33,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:52:33,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:52:33,504 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:52:33,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:52:34,237 INFO L? ?]: Removed 230 outVars from TransFormulas that were not future-live. [2024-11-09 07:52:34,237 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:52:34,260 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:52:34,260 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:52:34,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:52:34 BoogieIcfgContainer [2024-11-09 07:52:34,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:52:34,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:52:34,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:52:34,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:52:34,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:52:32" (1/3) ... [2024-11-09 07:52:34,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753014e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:52:34, skipping insertion in model container [2024-11-09 07:52:34,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:33" (2/3) ... [2024-11-09 07:52:34,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753014e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:52:34, skipping insertion in model container [2024-11-09 07:52:34,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:52:34" (3/3) ... [2024-11-09 07:52:34,268 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_4.i [2024-11-09 07:52:34,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:52:34,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2024-11-09 07:52:34,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:52:34,329 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;@23129c57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:52:34,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-11-09 07:52:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 107 states have (on average 1.841121495327103) internal successors, (197), 183 states have internal predecessors, (197), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:52:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:34,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:34,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:34,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:34,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1838385378, now seen corresponding path program 1 times [2024-11-09 07:52:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:34,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329814162] [2024-11-09 07:52:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:34,372 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 07:52:34,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:34,374 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 07:52:34,399 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 07:52:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:34,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:52:34,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:34,569 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 07:52:34,628 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 07:52:34,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:34,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329814162] [2024-11-09 07:52:34,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329814162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:34,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:34,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214256732] [2024-11-09 07:52:34,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:34,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:34,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:34,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:34,668 INFO L87 Difference]: Start difference. First operand has 198 states, 107 states have (on average 1.841121495327103) internal successors, (197), 183 states have internal predecessors, (197), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:35,372 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2024-11-09 07:52:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:35,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:35,390 INFO L225 Difference]: With dead ends: 214 [2024-11-09 07:52:35,390 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 07:52:35,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:35,398 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 10 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:35,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 810 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:52:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 07:52:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2024-11-09 07:52:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 113 states have (on average 1.7876106194690264) internal successors, (202), 188 states have internal predecessors, (202), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-09 07:52:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 221 transitions. [2024-11-09 07:52:35,481 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 221 transitions. Word has length 12 [2024-11-09 07:52:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:35,482 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 221 transitions. [2024-11-09 07:52:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 221 transitions. [2024-11-09 07:52:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:35,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:35,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:35,489 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 07:52:35,686 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 07:52:35,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:35,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1838385377, now seen corresponding path program 1 times [2024-11-09 07:52:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:35,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505404949] [2024-11-09 07:52:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:35,689 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 07:52:35,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:35,693 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 07:52:35,694 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 07:52:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:35,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:52:35,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:35,794 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 07:52:35,923 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 07:52:35,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:35,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505404949] [2024-11-09 07:52:35,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505404949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:35,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:35,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:52:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681054331] [2024-11-09 07:52:35,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:35,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:35,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:35,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:35,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:35,931 INFO L87 Difference]: Start difference. First operand 205 states and 221 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:36,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:36,806 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2024-11-09 07:52:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:36,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:36,809 INFO L225 Difference]: With dead ends: 209 [2024-11-09 07:52:36,809 INFO L226 Difference]: Without dead ends: 209 [2024-11-09 07:52:36,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:36,811 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:36,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1066 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:52:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-09 07:52:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2024-11-09 07:52:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 113 states have (on average 1.7699115044247788) internal successors, (200), 188 states have internal predecessors, (200), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-09 07:52:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 219 transitions. [2024-11-09 07:52:36,829 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 219 transitions. Word has length 12 [2024-11-09 07:52:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:36,830 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 219 transitions. [2024-11-09 07:52:36,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 219 transitions. [2024-11-09 07:52:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:36,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:36,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:36,836 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 07:52:37,032 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 07:52:37,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -95575043, now seen corresponding path program 1 times [2024-11-09 07:52:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:37,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320323687] [2024-11-09 07:52:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:37,034 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 07:52:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:37,036 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 07:52:37,038 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 07:52:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:37,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:52:37,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:37,181 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 07:52:37,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:37,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:37,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320323687] [2024-11-09 07:52:37,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320323687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:37,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:37,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:37,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082021934] [2024-11-09 07:52:37,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:37,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:52:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:52:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:37,186 INFO L87 Difference]: Start difference. First operand 205 states and 219 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:37,226 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2024-11-09 07:52:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:52:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:37,228 INFO L225 Difference]: With dead ends: 196 [2024-11-09 07:52:37,228 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 07:52:37,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:37,230 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:37,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 809 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 07:52:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-09 07:52:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 109 states have (on average 1.761467889908257) internal successors, (192), 180 states have internal predecessors, (192), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 07:52:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 209 transitions. [2024-11-09 07:52:37,253 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 209 transitions. Word has length 12 [2024-11-09 07:52:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:37,254 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 209 transitions. [2024-11-09 07:52:37,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2024-11-09 07:52:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:37,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:37,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:37,261 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 07:52:37,457 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 07:52:37,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:37,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1838471554, now seen corresponding path program 1 times [2024-11-09 07:52:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434335982] [2024-11-09 07:52:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:37,461 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 07:52:37,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:37,465 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 07:52:37,466 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 07:52:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:37,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:52:37,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:37,577 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 07:52:37,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:37,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434335982] [2024-11-09 07:52:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434335982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:37,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278337190] [2024-11-09 07:52:37,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:37,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:52:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:52:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:37,579 INFO L87 Difference]: Start difference. First operand 196 states and 209 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 07:52:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:37,630 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2024-11-09 07:52:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:52:37,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-09 07:52:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:37,632 INFO L225 Difference]: With dead ends: 197 [2024-11-09 07:52:37,632 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 07:52:37,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:37,633 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 98 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:37,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 687 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 07:52:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2024-11-09 07:52:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 109 states have (on average 1.7522935779816513) internal successors, (191), 180 states have internal predecessors, (191), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 07:52:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2024-11-09 07:52:37,650 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 12 [2024-11-09 07:52:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:37,650 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2024-11-09 07:52:37,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 07:52:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2024-11-09 07:52:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:37,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:37,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:37,656 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 07:52:37,851 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 07:52:37,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:37,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash -95661219, now seen corresponding path program 1 times [2024-11-09 07:52:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:37,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700087107] [2024-11-09 07:52:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:37,854 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 07:52:37,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:37,857 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 07:52:37,859 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 07:52:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:37,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:52:37,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:37,962 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 07:52:37,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:37,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700087107] [2024-11-09 07:52:37,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700087107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:37,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:37,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014558232] [2024-11-09 07:52:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:37,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:52:37,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:37,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:52:37,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:37,967 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 07:52:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:37,998 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2024-11-09 07:52:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:52:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2024-11-09 07:52:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:38,000 INFO L225 Difference]: With dead ends: 198 [2024-11-09 07:52:38,000 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 07:52:38,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:38,002 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 92 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:38,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 698 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 07:52:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-09 07:52:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 111 states have (on average 1.7387387387387387) internal successors, (193), 182 states have internal predecessors, (193), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 07:52:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 210 transitions. [2024-11-09 07:52:38,021 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 210 transitions. Word has length 12 [2024-11-09 07:52:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:38,021 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 210 transitions. [2024-11-09 07:52:38,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 07:52:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 210 transitions. [2024-11-09 07:52:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:52:38,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:38,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:38,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:52:38,222 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 07:52:38,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:38,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1329489612, now seen corresponding path program 1 times [2024-11-09 07:52:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:38,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662248815] [2024-11-09 07:52:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:38,224 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 07:52:38,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:38,225 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 07:52:38,226 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 07:52:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:38,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:52:38,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:38,327 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 07:52:38,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:38,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:38,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662248815] [2024-11-09 07:52:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662248815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:38,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:38,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:52:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471705915] [2024-11-09 07:52:38,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:38,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:38,329 INFO L87 Difference]: Start difference. First operand 198 states and 210 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 07:52:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:38,658 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2024-11-09 07:52:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:38,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-09 07:52:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:38,659 INFO L225 Difference]: With dead ends: 210 [2024-11-09 07:52:38,660 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 07:52:38,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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 07:52:38,660 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 51 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:38,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 365 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:52:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 07:52:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2024-11-09 07:52:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 106 states have (on average 1.7641509433962264) internal successors, (187), 177 states have internal predecessors, (187), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:52:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 203 transitions. [2024-11-09 07:52:38,667 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 203 transitions. Word has length 13 [2024-11-09 07:52:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 203 transitions. [2024-11-09 07:52:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 07:52:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 203 transitions. [2024-11-09 07:52:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:52:38,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:38,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:38,673 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 07:52:38,869 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 07:52:38,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:38,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash 185310255, now seen corresponding path program 1 times [2024-11-09 07:52:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:38,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853621083] [2024-11-09 07:52:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:38,871 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 07:52:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:38,872 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 07:52:38,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:52:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:38,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:52:38,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:39,058 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:52:39,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:39,105 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 07:52:39,172 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 07:52:39,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:39,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:39,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853621083] [2024-11-09 07:52:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853621083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:39,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:39,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134244324] [2024-11-09 07:52:39,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:39,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:39,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:52:39,175 INFO L87 Difference]: Start difference. First operand 192 states and 203 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:40,278 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2024-11-09 07:52:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:40,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-09 07:52:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:40,281 INFO L225 Difference]: With dead ends: 242 [2024-11-09 07:52:40,281 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 07:52:40,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-09 07:52:40,283 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 293 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:40,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 304 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 627 Invalid, 0 Unknown, 254 Unchecked, 1.0s Time] [2024-11-09 07:52:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 07:52:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 201. [2024-11-09 07:52:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 185 states have internal predecessors, (200), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 07:52:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2024-11-09 07:52:40,293 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 16 [2024-11-09 07:52:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:40,294 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2024-11-09 07:52:40,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2024-11-09 07:52:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:52:40,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:40,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] [2024-11-09 07:52:40,299 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 07:52:40,498 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 07:52:40,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:40,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash 576960996, now seen corresponding path program 1 times [2024-11-09 07:52:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:40,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194941950] [2024-11-09 07:52:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:40,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:40,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:40,503 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 07:52:40,503 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 07:52:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:40,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:52:40,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:40,609 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 07:52:40,662 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 07:52:40,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:40,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:40,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194941950] [2024-11-09 07:52:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194941950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:40,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:40,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495771987] [2024-11-09 07:52:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:40,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:40,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:40,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:40,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:40,665 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:41,132 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2024-11-09 07:52:41,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:52:41,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-09 07:52:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:41,134 INFO L225 Difference]: With dead ends: 250 [2024-11-09 07:52:41,134 INFO L226 Difference]: Without dead ends: 250 [2024-11-09 07:52:41,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:41,135 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:41,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 616 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:52:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-09 07:52:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 226. [2024-11-09 07:52:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 210 states have internal predecessors, (249), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 07:52:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 267 transitions. [2024-11-09 07:52:41,145 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 267 transitions. Word has length 25 [2024-11-09 07:52:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:41,145 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 267 transitions. [2024-11-09 07:52:41,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 267 transitions. [2024-11-09 07:52:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:52:41,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:41,147 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] [2024-11-09 07:52:41,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:41,347 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 07:52:41,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:41,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash 576960997, now seen corresponding path program 1 times [2024-11-09 07:52:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:41,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985916330] [2024-11-09 07:52:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:41,349 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 07:52:41,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:41,350 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 07:52:41,351 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 07:52:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:41,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:52:41,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:41,468 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 07:52:41,551 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 07:52:41,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:41,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:41,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985916330] [2024-11-09 07:52:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985916330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:41,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:41,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:41,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962165285] [2024-11-09 07:52:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:41,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:41,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:41,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:41,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:41,553 INFO L87 Difference]: Start difference. First operand 226 states and 267 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:42,047 INFO L93 Difference]: Finished difference Result 248 states and 273 transitions. [2024-11-09 07:52:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:52:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-09 07:52:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:42,049 INFO L225 Difference]: With dead ends: 248 [2024-11-09 07:52:42,049 INFO L226 Difference]: Without dead ends: 248 [2024-11-09 07:52:42,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:42,050 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 56 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:42,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 651 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:52:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-09 07:52:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 227. [2024-11-09 07:52:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 210 states have internal predecessors, (250), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2024-11-09 07:52:42,057 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 25 [2024-11-09 07:52:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:42,057 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2024-11-09 07:52:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2024-11-09 07:52:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:52:42,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:42,059 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 07:52:42,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 07:52:42,259 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 07:52:42,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:42,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash 408797056, now seen corresponding path program 1 times [2024-11-09 07:52:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:42,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70556957] [2024-11-09 07:52:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:42,260 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 07:52:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:42,262 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 07:52:42,262 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 07:52:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:42,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:52:42,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:42,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 07:52:42,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:42,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70556957] [2024-11-09 07:52:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70556957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:42,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739954674] [2024-11-09 07:52:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:42,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:42,391 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:42,459 INFO L93 Difference]: Finished difference Result 227 states and 270 transitions. [2024-11-09 07:52:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:52:42,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-09 07:52:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:42,461 INFO L225 Difference]: With dead ends: 227 [2024-11-09 07:52:42,461 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 07:52:42,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:42,462 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 75 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:42,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 831 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:52:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 07:52:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-09 07:52:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 144 states have (on average 1.7291666666666667) internal successors, (249), 210 states have internal predecessors, (249), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2024-11-09 07:52:42,469 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 27 [2024-11-09 07:52:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:42,469 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2024-11-09 07:52:42,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2024-11-09 07:52:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:52:42,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:42,470 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] [2024-11-09 07:52:42,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 07:52:42,673 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 07:52:42,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:42,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:42,674 INFO L85 PathProgramCache]: Analyzing trace with hash -205509552, now seen corresponding path program 1 times [2024-11-09 07:52:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047680530] [2024-11-09 07:52:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:42,675 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 07:52:42,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:42,676 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 07:52:42,677 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 07:52:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:42,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:52:42,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:42,820 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 07:52:42,875 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:52:42,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 07:52:42,940 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 07:52:42,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:42,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:42,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047680530] [2024-11-09 07:52:42,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047680530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:42,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:52:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656439060] [2024-11-09 07:52:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:42,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:42,942 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:43,709 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2024-11-09 07:52:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:43,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-09 07:52:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:43,711 INFO L225 Difference]: With dead ends: 239 [2024-11-09 07:52:43,711 INFO L226 Difference]: Without dead ends: 239 [2024-11-09 07:52:43,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:43,712 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 128 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:43,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 580 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:52:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-09 07:52:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 223. [2024-11-09 07:52:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 144 states have (on average 1.6736111111111112) internal successors, (241), 206 states have internal predecessors, (241), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 262 transitions. [2024-11-09 07:52:43,720 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 262 transitions. Word has length 33 [2024-11-09 07:52:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:43,720 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 262 transitions. [2024-11-09 07:52:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 262 transitions. [2024-11-09 07:52:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:52:43,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:43,721 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] [2024-11-09 07:52:43,726 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 07:52:43,921 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 07:52:43,922 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:43,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash -205509551, now seen corresponding path program 1 times [2024-11-09 07:52:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:43,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415623747] [2024-11-09 07:52:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:43,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:43,924 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 07:52:43,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 07:52:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:44,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:52:44,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:44,107 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 07:52:44,117 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 07:52:44,162 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-09 07:52:44,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:44,193 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 07:52:44,203 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:52:44,204 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 07:52:44,283 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 07:52:44,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:44,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:44,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415623747] [2024-11-09 07:52:44,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415623747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:44,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:44,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:44,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273033013] [2024-11-09 07:52:44,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:44,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:44,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:44,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:44,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-09 07:52:44,286 INFO L87 Difference]: Start difference. First operand 223 states and 262 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:45,013 INFO L93 Difference]: Finished difference Result 249 states and 273 transitions. [2024-11-09 07:52:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:52:45,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-09 07:52:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:45,015 INFO L225 Difference]: With dead ends: 249 [2024-11-09 07:52:45,016 INFO L226 Difference]: Without dead ends: 249 [2024-11-09 07:52:45,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:52:45,016 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 109 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:45,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 401 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 479 Invalid, 0 Unknown, 279 Unchecked, 0.7s Time] [2024-11-09 07:52:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-09 07:52:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 223. [2024-11-09 07:52:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 144 states have (on average 1.6458333333333333) internal successors, (237), 206 states have internal predecessors, (237), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 258 transitions. [2024-11-09 07:52:45,038 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 258 transitions. Word has length 33 [2024-11-09 07:52:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:45,041 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 258 transitions. [2024-11-09 07:52:45,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 258 transitions. [2024-11-09 07:52:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:52:45,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:45,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] [2024-11-09 07:52:45,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:45,243 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 07:52:45,243 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:45,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash 73776804, now seen corresponding path program 1 times [2024-11-09 07:52:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:45,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922177104] [2024-11-09 07:52:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:45,244 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 07:52:45,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:45,246 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 07:52:45,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 07:52:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:45,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:52:45,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:45,399 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 07:52:45,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:45,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:45,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922177104] [2024-11-09 07:52:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922177104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:45,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:52:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336456040] [2024-11-09 07:52:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:45,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:45,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:45,401 INFO L87 Difference]: Start difference. First operand 223 states and 258 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:45,418 INFO L93 Difference]: Finished difference Result 227 states and 262 transitions. [2024-11-09 07:52:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:45,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-09 07:52:45,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:45,421 INFO L225 Difference]: With dead ends: 227 [2024-11-09 07:52:45,422 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 07:52:45,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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 07:52:45,423 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:45,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 07:52:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-09 07:52:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 148 states have (on average 1.6283783783783783) internal successors, (241), 210 states have internal predecessors, (241), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 262 transitions. [2024-11-09 07:52:45,429 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 262 transitions. Word has length 35 [2024-11-09 07:52:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:45,429 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 262 transitions. [2024-11-09 07:52:45,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 262 transitions. [2024-11-09 07:52:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:52:45,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:45,430 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] [2024-11-09 07:52:45,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:45,634 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 07:52:45,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:45,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2007886443, now seen corresponding path program 1 times [2024-11-09 07:52:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777664279] [2024-11-09 07:52:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:45,636 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 07:52:45,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:45,640 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 07:52:45,641 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 07:52:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:45,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:52:45,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:46,201 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 07:52:46,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:46,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:46,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777664279] [2024-11-09 07:52:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777664279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:46,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:46,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:46,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276376818] [2024-11-09 07:52:46,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:46,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:46,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:46,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:46,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:46,204 INFO L87 Difference]: Start difference. First operand 227 states and 262 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:46,579 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2024-11-09 07:52:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-09 07:52:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:46,581 INFO L225 Difference]: With dead ends: 225 [2024-11-09 07:52:46,581 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 07:52:46,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:46,581 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 355 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:46,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 706 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:52:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 07:52:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-09 07:52:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 148 states have (on average 1.6081081081081081) internal successors, (238), 208 states have internal predecessors, (238), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 259 transitions. [2024-11-09 07:52:46,587 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 259 transitions. Word has length 36 [2024-11-09 07:52:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:46,588 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 259 transitions. [2024-11-09 07:52:46,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 259 transitions. [2024-11-09 07:52:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:52:46,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:46,589 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] [2024-11-09 07:52:46,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:46,789 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 07:52:46,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:46,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1071950375, now seen corresponding path program 1 times [2024-11-09 07:52:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:46,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759243553] [2024-11-09 07:52:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:46,791 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 07:52:46,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:46,792 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 07:52:46,793 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 07:52:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:46,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:52:46,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:46,949 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 07:52:46,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:46,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:46,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759243553] [2024-11-09 07:52:46,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759243553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:46,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:46,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:52:46,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572096815] [2024-11-09 07:52:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:46,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:46,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:46,952 INFO L87 Difference]: Start difference. First operand 225 states and 259 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:46,971 INFO L93 Difference]: Finished difference Result 227 states and 261 transitions. [2024-11-09 07:52:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:46,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-09 07:52:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:46,973 INFO L225 Difference]: With dead ends: 227 [2024-11-09 07:52:46,973 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 07:52:46,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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 07:52:46,974 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:46,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 07:52:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-09 07:52:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 150 states have (on average 1.6) internal successors, (240), 210 states have internal predecessors, (240), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2024-11-09 07:52:46,980 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 40 [2024-11-09 07:52:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:46,980 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2024-11-09 07:52:46,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2024-11-09 07:52:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:52:46,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:46,981 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] [2024-11-09 07:52:46,987 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 07:52:47,185 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 07:52:47,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:47,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash -647766642, now seen corresponding path program 1 times [2024-11-09 07:52:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525662649] [2024-11-09 07:52:47,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:47,187 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 07:52:47,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:47,188 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 07:52:47,189 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 07:52:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:47,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:52:47,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:47,415 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 8 treesize of output 1 [2024-11-09 07:52:47,523 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-09 07:52:47,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 07:52:47,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 07:52:47,760 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2024-11-09 07:52:47,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2024-11-09 07:52:48,221 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:52:48,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:48,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 07:52:48,299 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 07:52:48,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:48,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525662649] [2024-11-09 07:52:48,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525662649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:48,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:48,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:52:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446703751] [2024-11-09 07:52:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:48,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:52:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:52:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:52:48,301 INFO L87 Difference]: Start difference. First operand 227 states and 261 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:50,077 INFO L93 Difference]: Finished difference Result 322 states and 355 transitions. [2024-11-09 07:52:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:52:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-09 07:52:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:50,078 INFO L225 Difference]: With dead ends: 322 [2024-11-09 07:52:50,078 INFO L226 Difference]: Without dead ends: 322 [2024-11-09 07:52:50,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:52:50,079 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 424 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:50,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 806 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 07:52:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-09 07:52:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 247. [2024-11-09 07:52:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 226 states have internal predecessors, (269), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-09 07:52:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 293 transitions. [2024-11-09 07:52:50,086 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 293 transitions. Word has length 42 [2024-11-09 07:52:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:50,086 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 293 transitions. [2024-11-09 07:52:50,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 293 transitions. [2024-11-09 07:52:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:52:50,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:50,087 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] [2024-11-09 07:52:50,095 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 07:52:50,291 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 07:52:50,292 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:50,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash -647766641, now seen corresponding path program 1 times [2024-11-09 07:52:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035913108] [2024-11-09 07:52:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:50,293 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 07:52:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:50,296 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 07:52:50,297 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 07:52:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:50,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:52:50,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:50,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:50,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 07:52:50,692 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:52:50,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 07:52:50,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:50,942 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 07:52:51,089 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:52:51,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:52:51,317 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 07:52:51,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:51,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035913108] [2024-11-09 07:52:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035913108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:51,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:51,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:52:51,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128548204] [2024-11-09 07:52:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:51,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:52:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:52:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:52:51,322 INFO L87 Difference]: Start difference. First operand 247 states and 293 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:54,128 INFO L93 Difference]: Finished difference Result 273 states and 315 transitions. [2024-11-09 07:52:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:52:54,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2024-11-09 07:52:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:54,130 INFO L225 Difference]: With dead ends: 273 [2024-11-09 07:52:54,130 INFO L226 Difference]: Without dead ends: 273 [2024-11-09 07:52:54,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:52:54,131 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 592 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:54,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 459 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 976 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 07:52:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-09 07:52:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 236. [2024-11-09 07:52:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 161 states have (on average 1.5714285714285714) internal successors, (253), 216 states have internal predecessors, (253), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 274 transitions. [2024-11-09 07:52:54,137 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 274 transitions. Word has length 42 [2024-11-09 07:52:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:54,138 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 274 transitions. [2024-11-09 07:52:54,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 274 transitions. [2024-11-09 07:52:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:52:54,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:54,139 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 07:52:54,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 07:52:54,343 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 07:52:54,344 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:54,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 525576022, now seen corresponding path program 1 times [2024-11-09 07:52:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054766927] [2024-11-09 07:52:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:54,345 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 07:52:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:54,348 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 07:52:54,349 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 07:52:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:54,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:52:54,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:54,536 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 07:52:54,618 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 07:52:54,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:54,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054766927] [2024-11-09 07:52:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054766927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:54,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:54,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063289650] [2024-11-09 07:52:54,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:54,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:54,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:54,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:54,622 INFO L87 Difference]: Start difference. First operand 236 states and 274 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:55,193 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2024-11-09 07:52:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-09 07:52:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:55,194 INFO L225 Difference]: With dead ends: 246 [2024-11-09 07:52:55,194 INFO L226 Difference]: Without dead ends: 246 [2024-11-09 07:52:55,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:55,195 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 32 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:55,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 703 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:52:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-09 07:52:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 235. [2024-11-09 07:52:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 161 states have (on average 1.5527950310559007) internal successors, (250), 215 states have internal predecessors, (250), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 271 transitions. [2024-11-09 07:52:55,200 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 271 transitions. Word has length 43 [2024-11-09 07:52:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:55,201 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 271 transitions. [2024-11-09 07:52:55,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 271 transitions. [2024-11-09 07:52:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:52:55,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:55,202 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 07:52:55,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 07:52:55,402 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 07:52:55,403 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 525576023, now seen corresponding path program 1 times [2024-11-09 07:52:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245703815] [2024-11-09 07:52:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:55,404 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 07:52:55,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:55,407 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 07:52:55,408 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 07:52:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:55,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:52:55,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:55,595 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 07:52:55,747 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 07:52:55,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:55,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:55,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245703815] [2024-11-09 07:52:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245703815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:55,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667641346] [2024-11-09 07:52:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:55,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:55,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:55,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:55,749 INFO L87 Difference]: Start difference. First operand 235 states and 271 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:56,277 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2024-11-09 07:52:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:52:56,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-09 07:52:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:56,279 INFO L225 Difference]: With dead ends: 244 [2024-11-09 07:52:56,279 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 07:52:56,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:56,280 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 28 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:56,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 739 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:52:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 07:52:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 235. [2024-11-09 07:52:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 215 states have internal predecessors, (248), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 269 transitions. [2024-11-09 07:52:56,287 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 269 transitions. Word has length 43 [2024-11-09 07:52:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:56,287 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 269 transitions. [2024-11-09 07:52:56,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 269 transitions. [2024-11-09 07:52:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:52:56,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:56,288 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 07:52:56,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-09 07:52:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:56,489 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1394090683, now seen corresponding path program 1 times [2024-11-09 07:52:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58029889] [2024-11-09 07:52:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:56,491 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 07:52:56,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:56,494 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:52:56,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 07:52:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:56,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:52:56,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:56,662 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 07:52:56,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:56,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58029889] [2024-11-09 07:52:56,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58029889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:56,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:56,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:52:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202809743] [2024-11-09 07:52:56,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:56,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:56,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:56,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:56,664 INFO L87 Difference]: Start difference. First operand 235 states and 269 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:56,683 INFO L93 Difference]: Finished difference Result 237 states and 270 transitions. [2024-11-09 07:52:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-09 07:52:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:56,685 INFO L225 Difference]: With dead ends: 237 [2024-11-09 07:52:56,685 INFO L226 Difference]: Without dead ends: 237 [2024-11-09 07:52:56,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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 07:52:56,686 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:56,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 549 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-09 07:52:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-09 07:52:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 217 states have internal predecessors, (249), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 270 transitions. [2024-11-09 07:52:56,694 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 270 transitions. Word has length 43 [2024-11-09 07:52:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:56,694 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 270 transitions. [2024-11-09 07:52:56,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 270 transitions. [2024-11-09 07:52:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:52:56,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:56,695 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] [2024-11-09 07:52:56,701 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 (21)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:56,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:56,897 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:52:56,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash -327729681, now seen corresponding path program 1 times [2024-11-09 07:52:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:56,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548137864] [2024-11-09 07:52:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:56,898 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 07:52:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:56,901 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:52:56,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 07:52:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:57,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:52:57,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:57,132 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 07:52:57,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:52:57,351 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-09 07:52:57,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:52:57,404 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-09 07:52:57,404 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 19 treesize of output 11 [2024-11-09 07:52:57,795 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-09 07:52:57,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:52:58,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2024-11-09 07:52:58,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2024-11-09 07:52:58,940 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-09 07:52:58,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-11-09 07:52:59,009 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:52:59,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 07:52:59,182 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 07:52:59,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:59,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548137864] [2024-11-09 07:52:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548137864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:59,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:59,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 07:52:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366872843] [2024-11-09 07:52:59,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:59,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:52:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:52:59,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:52:59,184 INFO L87 Difference]: Start difference. First operand 237 states and 270 transitions. Second operand has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:53:03,692 INFO L93 Difference]: Finished difference Result 373 states and 417 transitions. [2024-11-09 07:53:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 07:53:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2024-11-09 07:53:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:53:03,695 INFO L225 Difference]: With dead ends: 373 [2024-11-09 07:53:03,695 INFO L226 Difference]: Without dead ends: 373 [2024-11-09 07:53:03,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 07:53:03,696 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 444 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:53:03,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1380 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 07:53:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-09 07:53:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 297. [2024-11-09 07:53:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 217 states have (on average 1.5391705069124424) internal successors, (334), 273 states have internal predecessors, (334), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-09 07:53:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 363 transitions. [2024-11-09 07:53:03,704 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 363 transitions. Word has length 45 [2024-11-09 07:53:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:53:03,705 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 363 transitions. [2024-11-09 07:53:03,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 363 transitions. [2024-11-09 07:53:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:53:03,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:53:03,705 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] [2024-11-09 07:53:03,713 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 (22)] Ended with exit code 0 [2024-11-09 07:53:03,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:53:03,906 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:53:03,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:53:03,907 INFO L85 PathProgramCache]: Analyzing trace with hash -327729680, now seen corresponding path program 1 times [2024-11-09 07:53:03,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:53:03,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357725980] [2024-11-09 07:53:03,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:53:03,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:53:03,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:53:03,908 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:53:03,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 07:53:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:53:04,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 07:53:04,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:53:04,182 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 07:53:04,187 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 07:53:04,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:53:04,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:53:04,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:53:04,456 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 18 treesize of output 13 [2024-11-09 07:53:04,492 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-09 07:53:04,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:53:04,568 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-09 07:53:04,568 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 19 treesize of output 11 [2024-11-09 07:53:04,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:53:04,881 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2024-11-09 07:53:04,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 07:53:04,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 07:53:05,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:53:05,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 07:53:05,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 07:53:05,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:53:06,003 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 25 treesize of output 13 [2024-11-09 07:53:06,280 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 07:53:06,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:53:06,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:53:06,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357725980] [2024-11-09 07:53:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357725980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:53:06,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:53:06,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 07:53:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51441818] [2024-11-09 07:53:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:53:06,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:53:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:53:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:53:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:53:06,283 INFO L87 Difference]: Start difference. First operand 297 states and 363 transitions. Second operand has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:11,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:23,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:27,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:32,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:35,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:45,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:48,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:53:50,617 INFO L93 Difference]: Finished difference Result 450 states and 498 transitions. [2024-11-09 07:53:50,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 07:53:50,619 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2024-11-09 07:53:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:53:50,620 INFO L225 Difference]: With dead ends: 450 [2024-11-09 07:53:50,620 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 07:53:50,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=222, Invalid=1499, Unknown=1, NotChecked=0, Total=1722 [2024-11-09 07:53:50,621 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 738 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 54 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:53:50,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1096 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2021 Invalid, 3 Unknown, 0 Unchecked, 34.7s Time] [2024-11-09 07:53:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 07:53:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 340. [2024-11-09 07:53:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 254 states have (on average 1.5590551181102361) internal successors, (396), 312 states have internal predecessors, (396), 15 states have call successors, (15), 12 states have call predecessors, (15), 14 states have return successors, (23), 15 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-09 07:53:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 434 transitions. [2024-11-09 07:53:50,630 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 434 transitions. Word has length 45 [2024-11-09 07:53:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:53:50,630 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 434 transitions. [2024-11-09 07:53:50,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 434 transitions. [2024-11-09 07:53:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:53:50,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:53:50,632 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] [2024-11-09 07:53:50,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-09 07:53:50,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:53:50,832 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:53:50,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:53:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2015364599, now seen corresponding path program 1 times [2024-11-09 07:53:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:53:50,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097816727] [2024-11-09 07:53:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:53:50,833 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 07:53:50,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:53:50,836 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:53:50,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 07:53:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:53:51,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:53:51,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:53:51,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-09 07:53:51,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:53:51,423 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 16 treesize of output 13 [2024-11-09 07:53:51,496 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:53:51,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 07:53:51,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:53:51,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-11-09 07:53:51,816 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 7 treesize of output 3 [2024-11-09 07:53:51,930 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 07:53:51,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:53:51,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:53:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097816727] [2024-11-09 07:53:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097816727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:53:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:53:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 07:53:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467765442] [2024-11-09 07:53:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:53:51,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:53:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:53:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:53:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:53:51,932 INFO L87 Difference]: Start difference. First operand 340 states and 434 transitions. Second operand has 18 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:53:54,295 INFO L93 Difference]: Finished difference Result 360 states and 437 transitions. [2024-11-09 07:53:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:53:54,296 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2024-11-09 07:53:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:53:54,297 INFO L225 Difference]: With dead ends: 360 [2024-11-09 07:53:54,297 INFO L226 Difference]: Without dead ends: 360 [2024-11-09 07:53:54,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 07:53:54,298 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 751 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:53:54,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 791 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 07:53:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-09 07:53:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 336. [2024-11-09 07:53:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 252 states have (on average 1.5317460317460319) internal successors, (386), 308 states have internal predecessors, (386), 15 states have call successors, (15), 12 states have call predecessors, (15), 14 states have return successors, (23), 15 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-09 07:53:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 424 transitions. [2024-11-09 07:53:54,308 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 424 transitions. Word has length 46 [2024-11-09 07:53:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:53:54,308 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 424 transitions. [2024-11-09 07:53:54,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 424 transitions. [2024-11-09 07:53:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:53:54,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:53:54,309 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] [2024-11-09 07:53:54,318 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 (24)] Ended with exit code 0 [2024-11-09 07:53:54,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 07:53:54,510 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-11-09 07:53:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:53:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2015364598, now seen corresponding path program 1 times [2024-11-09 07:53:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:53:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176246979] [2024-11-09 07:53:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:53:54,511 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 07:53:54,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:53:54,514 INFO L229 MonitoredProcess]: Starting monitored process 25 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 07:53:54,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-09 07:53:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:53:54,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 07:53:54,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:53:54,977 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:53:55,054 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-09 07:53:55,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 07:53:55,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 07:53:55,207 INFO L349 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2024-11-09 07:53:55,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2024-11-09 07:53:55,230 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:53:55,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:53:55,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-09 07:53:55,505 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:53:55,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2024-11-09 07:53:55,542 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-09 07:53:55,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 48 [2024-11-09 07:53:55,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:53:55,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:53:55,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-11-09 07:53:55,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-11-09 07:53:56,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:53:56,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:53:56,781 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 07:53:56,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:53:56,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:53:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176246979] [2024-11-09 07:53:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176246979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:53:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:53:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 07:53:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486425663] [2024-11-09 07:53:56,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:53:56,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:53:56,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:53:56,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:53:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=209, Unknown=1, NotChecked=28, Total=272 [2024-11-09 07:53:56,784 INFO L87 Difference]: Start difference. First operand 336 states and 424 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)