./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:01:07,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:01:07,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:01:07,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:01:07,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:01:07,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:01:07,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:01:07,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:01:07,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:01:07,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:01:07,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:01:07,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:01:07,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:01:07,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:01:07,584 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:01:07,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:01:07,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:01:07,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:01:07,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:01:07,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:01:07,586 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:01:07,586 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:01:07,587 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:01:07,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:01:07,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:01:07,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:01:07,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:01:07,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:01:07,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:01:07,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:01:07,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:01:07,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:01:07,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:01:07,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:01:07,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:01:07,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:01:07,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:01:07,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:01:07,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:01:07,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:01:07,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:01:07,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:01:07,591 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 -> 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 [2024-11-20 17:01:07,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:01:07,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:01:07,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:01:07,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:01:07,885 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:01:07,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2024-11-20 17:01:09,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:01:09,661 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:01:09,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2024-11-20 17:01:09,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35239be01/e30fcc6a8747498693c31329b783e5f8/FLAG2e470fcb4 [2024-11-20 17:01:09,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35239be01/e30fcc6a8747498693c31329b783e5f8 [2024-11-20 17:01:09,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:01:09,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:01:09,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:01:09,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:01:09,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:01:09,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:01:09" (1/1) ... [2024-11-20 17:01:09,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230e9853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:09, skipping insertion in model container [2024-11-20 17:01:09,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:01:09" (1/1) ... [2024-11-20 17:01:09,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:01:10,200 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,238 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,241 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,244 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,250 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,291 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,292 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,299 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,308 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,342 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,346 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,348 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,348 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,350 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,356 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,358 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,363 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,367 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,368 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,368 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,369 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,372 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:10,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:01:10,394 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-20 17:01:10,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@605bc2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:10, skipping insertion in model container [2024-11-20 17:01:10,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:01:10,396 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 17:01:10,398 INFO L158 Benchmark]: Toolchain (without parser) took 699.28ms. Allocated memory is still 148.9MB. Free memory was 70.9MB in the beginning and 102.6MB in the end (delta: -31.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-20 17:01:10,399 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 148.9MB. Free memory was 120.1MB in the beginning and 119.8MB in the end (delta: 325.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:01:10,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.66ms. Allocated memory is still 148.9MB. Free memory was 70.9MB in the beginning and 102.6MB in the end (delta: -31.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-20 17:01:10,401 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 148.9MB. Free memory was 120.1MB in the beginning and 119.8MB in the end (delta: 325.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.66ms. Allocated memory is still 148.9MB. Free memory was 70.9MB in the beginning and 102.6MB in the end (delta: -31.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:01:12,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:01:12,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:01:12,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:01:12,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:01:12,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:01:12,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:01:12,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:01:12,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:01:12,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:01:12,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:01:12,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:01:12,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:01:12,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:01:12,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:01:12,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:01:12,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:01:12,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:01:12,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:01:12,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:01:12,521 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:01:12,525 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:01:12,525 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:01:12,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:01:12,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:01:12,526 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:01:12,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:01:12,527 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:01:12,527 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:01:12,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:01:12,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:01:12,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:01:12,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:01:12,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:01:12,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:01:12,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:01:12,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:01:12,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:01:12,529 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:01:12,529 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:01:12,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:01:12,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:01:12,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:01:12,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:01:12,532 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 -> 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 [2024-11-20 17:01:12,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:01:12,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:01:12,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:01:12,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:01:12,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:01:12,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2024-11-20 17:01:14,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:01:14,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:01:14,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2024-11-20 17:01:14,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecb0e606/4baf0511c18a4e02b075dce35746dc15/FLAG3d7080cf1 [2024-11-20 17:01:14,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecb0e606/4baf0511c18a4e02b075dce35746dc15 [2024-11-20 17:01:14,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:01:14,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:01:14,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:01:14,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:01:14,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:01:14,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:01:14" (1/1) ... [2024-11-20 17:01:14,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1b3696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:14, skipping insertion in model container [2024-11-20 17:01:14,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:01:14" (1/1) ... [2024-11-20 17:01:14,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:01:15,448 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,485 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,489 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,497 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,554 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,558 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,564 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,568 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,601 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,601 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,603 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,603 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,605 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,607 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,608 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,620 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,622 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,623 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,623 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,626 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:01:15,650 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 17:01:15,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:01:15,688 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,696 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,698 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,699 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,703 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,723 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,725 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,726 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,729 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,744 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,745 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,746 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,747 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,748 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,749 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,750 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,751 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,755 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,762 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,764 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,764 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,766 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:01:15,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:01:15,778 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:01:15,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:01:15,947 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:01:15,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15 WrapperNode [2024-11-20 17:01:15,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:01:15,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:01:15,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:01:15,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:01:15,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,098 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1759 [2024-11-20 17:01:16,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:01:16,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:01:16,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:01:16,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:01:16,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,301 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1]. [2024-11-20 17:01:16,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:01:16,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:01:16,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:01:16,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:01:16,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2024-11-20 17:01:16,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:01:16,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:01:16,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:01:16,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:01:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 17:01:16,505 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 17:01:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 17:01:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 17:01:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 17:01:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 17:01:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 17:01:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 17:01:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 17:01:16,506 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 17:01:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 17:01:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 17:01:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-20 17:01:16,506 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 17:01:16,506 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 17:01:16,506 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-20 17:01:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 17:01:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:01:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 17:01:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 17:01:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 17:01:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:01:16,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:01:16,807 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:01:16,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:01:16,832 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:01:16,884 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:01:16,907 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:01:22,450 INFO L? ?]: Removed 1907 outVars from TransFormulas that were not future-live. [2024-11-20 17:01:22,450 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:01:22,504 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:01:22,505 INFO L316 CfgBuilder]: Removed 100 assume(true) statements. [2024-11-20 17:01:22,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:01:22 BoogieIcfgContainer [2024-11-20 17:01:22,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:01:22,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:01:22,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:01:22,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:01:22,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:01:14" (1/3) ... [2024-11-20 17:01:22,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665be06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:01:22, skipping insertion in model container [2024-11-20 17:01:22,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (2/3) ... [2024-11-20 17:01:22,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665be06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:01:22, skipping insertion in model container [2024-11-20 17:01:22,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:01:22" (3/3) ... [2024-11-20 17:01:22,516 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-3.i [2024-11-20 17:01:22,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:01:22,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 915 error locations. [2024-11-20 17:01:22,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:01:22,617 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;@fc14ba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:01:22,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 915 error locations. [2024-11-20 17:01:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 1824 states, 898 states have (on average 2.2371937639198216) internal successors, (2009), 1814 states have internal predecessors, (2009), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 17:01:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:01:22,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:22,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:01:22,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:22,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-20 17:01:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:22,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844010685] [2024-11-20 17:01:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:22,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:22,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:22,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:22,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 17:01:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:22,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 17:01:22,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:22,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:22,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:22,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844010685] [2024-11-20 17:01:22,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844010685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:22,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:22,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:01:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092436904] [2024-11-20 17:01:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:22,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 17:01:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:22,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 17:01:22,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 17:01:22,900 INFO L87 Difference]: Start difference. First operand has 1824 states, 898 states have (on average 2.2371937639198216) internal successors, (2009), 1814 states have internal predecessors, (2009), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:23,003 INFO L93 Difference]: Finished difference Result 1804 states and 1905 transitions. [2024-11-20 17:01:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 17:01:23,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 17:01:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:23,026 INFO L225 Difference]: With dead ends: 1804 [2024-11-20 17:01:23,026 INFO L226 Difference]: Without dead ends: 1802 [2024-11-20 17:01:23,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 17:01:23,031 INFO L432 NwaCegarLoop]: 1905 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:23,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:01:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-20 17:01:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2024-11-20 17:01:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 888 states have (on average 2.115990990990991) internal successors, (1879), 1792 states have internal predecessors, (1879), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 1903 transitions. [2024-11-20 17:01:23,135 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 1903 transitions. Word has length 5 [2024-11-20 17:01:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 1903 transitions. [2024-11-20 17:01:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 1903 transitions. [2024-11-20 17:01:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:01:23,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:23,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:01:23,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:23,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:23,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-20 17:01:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:23,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885858674] [2024-11-20 17:01:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:23,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:23,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:23,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:23,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 17:01:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:23,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:01:23,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:23,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:01:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:23,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:23,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:23,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885858674] [2024-11-20 17:01:23,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885858674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:23,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:23,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:01:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396524551] [2024-11-20 17:01:23,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:23,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:01:23,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:01:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:23,593 INFO L87 Difference]: Start difference. First operand 1802 states and 1903 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:25,963 INFO L93 Difference]: Finished difference Result 1938 states and 2071 transitions. [2024-11-20 17:01:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:01:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 17:01:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:25,970 INFO L225 Difference]: With dead ends: 1938 [2024-11-20 17:01:25,970 INFO L226 Difference]: Without dead ends: 1938 [2024-11-20 17:01:25,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:25,972 INFO L432 NwaCegarLoop]: 1368 mSDtfsCounter, 1264 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:25,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 1742 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 17:01:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2024-11-20 17:01:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1710. [2024-11-20 17:01:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 888 states have (on average 2.0123873873873874) internal successors, (1787), 1700 states have internal predecessors, (1787), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 1811 transitions. [2024-11-20 17:01:26,004 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 1811 transitions. Word has length 5 [2024-11-20 17:01:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:26,005 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 1811 transitions. [2024-11-20 17:01:26,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 1811 transitions. [2024-11-20 17:01:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:01:26,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:26,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:01:26,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:26,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:26,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:26,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:26,210 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-20 17:01:26,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:26,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678000096] [2024-11-20 17:01:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:26,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:26,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:26,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:26,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 17:01:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:26,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:01:26,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:26,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:01:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:26,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:26,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:26,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678000096] [2024-11-20 17:01:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678000096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:26,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:01:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464964245] [2024-11-20 17:01:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:26,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:01:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:01:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:26,387 INFO L87 Difference]: Start difference. First operand 1710 states and 1811 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:29,112 INFO L93 Difference]: Finished difference Result 2256 states and 2408 transitions. [2024-11-20 17:01:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:01:29,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 17:01:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:29,121 INFO L225 Difference]: With dead ends: 2256 [2024-11-20 17:01:29,121 INFO L226 Difference]: Without dead ends: 2256 [2024-11-20 17:01:29,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:29,125 INFO L432 NwaCegarLoop]: 1732 mSDtfsCounter, 768 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:29,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2539 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 17:01:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-11-20 17:01:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1877. [2024-11-20 17:01:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1065 states have (on average 1.9784037558685446) internal successors, (2107), 1867 states have internal predecessors, (2107), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2131 transitions. [2024-11-20 17:01:29,165 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2131 transitions. Word has length 5 [2024-11-20 17:01:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:29,165 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2131 transitions. [2024-11-20 17:01:29,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2131 transitions. [2024-11-20 17:01:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 17:01:29,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:29,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 17:01:29,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:29,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:29,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:29,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1956327503, now seen corresponding path program 1 times [2024-11-20 17:01:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018567981] [2024-11-20 17:01:29,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:29,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:29,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:29,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:29,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 17:01:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:29,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:01:29,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:29,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:29,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:29,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018567981] [2024-11-20 17:01:29,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018567981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:29,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:29,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:01:29,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812645517] [2024-11-20 17:01:29,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:29,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:01:29,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:29,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:01:29,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:29,529 INFO L87 Difference]: Start difference. First operand 1877 states and 2131 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:29,678 INFO L93 Difference]: Finished difference Result 3354 states and 3843 transitions. [2024-11-20 17:01:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:01:29,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 17:01:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:29,695 INFO L225 Difference]: With dead ends: 3354 [2024-11-20 17:01:29,695 INFO L226 Difference]: Without dead ends: 3354 [2024-11-20 17:01:29,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:29,698 INFO L432 NwaCegarLoop]: 1797 mSDtfsCounter, 1357 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:29,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 3587 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:01:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2024-11-20 17:01:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 1879. [2024-11-20 17:01:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1067 states have (on average 1.9765698219306467) internal successors, (2109), 1869 states have internal predecessors, (2109), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2133 transitions. [2024-11-20 17:01:29,752 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2133 transitions. Word has length 6 [2024-11-20 17:01:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:29,753 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2133 transitions. [2024-11-20 17:01:29,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2133 transitions. [2024-11-20 17:01:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 17:01:29,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:29,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:29,758 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 (5)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:29,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:29,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:29,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-20 17:01:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:29,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431427375] [2024-11-20 17:01:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:29,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:29,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:29,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:29,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 17:01:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:30,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:01:30,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:30,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:30,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:30,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431427375] [2024-11-20 17:01:30,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431427375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:30,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:30,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:01:30,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447722035] [2024-11-20 17:01:30,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:30,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:01:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:01:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:30,152 INFO L87 Difference]: Start difference. First operand 1879 states and 2133 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:30,206 INFO L93 Difference]: Finished difference Result 1837 states and 2090 transitions. [2024-11-20 17:01:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:01:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 17:01:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:30,213 INFO L225 Difference]: With dead ends: 1837 [2024-11-20 17:01:30,214 INFO L226 Difference]: Without dead ends: 1837 [2024-11-20 17:01:30,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:30,215 INFO L432 NwaCegarLoop]: 1746 mSDtfsCounter, 71 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:30,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3429 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:01:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2024-11-20 17:01:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2024-11-20 17:01:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1049 states have (on average 1.9694947569113441) internal successors, (2066), 1827 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2090 transitions. [2024-11-20 17:01:30,246 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2090 transitions. Word has length 11 [2024-11-20 17:01:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:30,246 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2090 transitions. [2024-11-20 17:01:30,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2090 transitions. [2024-11-20 17:01:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 17:01:30,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:30,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:30,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:30,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:30,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:30,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1407004526, now seen corresponding path program 1 times [2024-11-20 17:01:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571325681] [2024-11-20 17:01:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:30,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:30,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:30,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:30,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 17:01:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:30,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:01:30,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:30,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:30,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571325681] [2024-11-20 17:01:30,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571325681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:30,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:30,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:01:30,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614563988] [2024-11-20 17:01:30,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:30,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:01:30,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:01:30,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:01:30,649 INFO L87 Difference]: Start difference. First operand 1837 states and 2090 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:30,742 INFO L93 Difference]: Finished difference Result 1815 states and 2061 transitions. [2024-11-20 17:01:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:01:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 17:01:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:30,749 INFO L225 Difference]: With dead ends: 1815 [2024-11-20 17:01:30,750 INFO L226 Difference]: Without dead ends: 1815 [2024-11-20 17:01:30,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:01:30,751 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 48 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5077 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:30,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 5077 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:01:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2024-11-20 17:01:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1815. [2024-11-20 17:01:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1041 states have (on average 1.956772334293948) internal successors, (2037), 1805 states have internal predecessors, (2037), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2061 transitions. [2024-11-20 17:01:30,787 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2061 transitions. Word has length 13 [2024-11-20 17:01:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:30,788 INFO L471 AbstractCegarLoop]: Abstraction has 1815 states and 2061 transitions. [2024-11-20 17:01:30,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2061 transitions. [2024-11-20 17:01:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 17:01:30,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:30,794 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-20 17:01:30,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:30,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:30,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:30,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1466507840, now seen corresponding path program 1 times [2024-11-20 17:01:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:30,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10310791] [2024-11-20 17:01:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:30,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:30,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:30,998 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:31,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 17:01:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:31,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:01:31,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:31,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:01:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:31,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:31,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10310791] [2024-11-20 17:01:31,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10310791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:31,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:31,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:01:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002941823] [2024-11-20 17:01:31,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:31,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:01:31,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:01:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:01:31,250 INFO L87 Difference]: Start difference. First operand 1815 states and 2061 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:33,827 INFO L93 Difference]: Finished difference Result 1815 states and 2061 transitions. [2024-11-20 17:01:33,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:01:33,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 17:01:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:33,833 INFO L225 Difference]: With dead ends: 1815 [2024-11-20 17:01:33,833 INFO L226 Difference]: Without dead ends: 1815 [2024-11-20 17:01:33,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:01:33,834 INFO L432 NwaCegarLoop]: 1068 mSDtfsCounter, 1201 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:33,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 2080 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1842 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 17:01:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2024-11-20 17:01:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1811. [2024-11-20 17:01:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1041 states have (on average 1.9529298751200768) internal successors, (2033), 1801 states have internal predecessors, (2033), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2057 transitions. [2024-11-20 17:01:33,859 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2057 transitions. Word has length 27 [2024-11-20 17:01:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:33,859 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2057 transitions. [2024-11-20 17:01:33,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2057 transitions. [2024-11-20 17:01:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 17:01:33,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:33,860 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-20 17:01:33,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:34,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:34,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:34,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1466507841, now seen corresponding path program 1 times [2024-11-20 17:01:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897638060] [2024-11-20 17:01:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:34,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:34,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:34,063 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:34,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 17:01:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:34,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:01:34,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:34,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:01:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:34,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:34,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897638060] [2024-11-20 17:01:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897638060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:01:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131172452] [2024-11-20 17:01:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:34,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:01:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:01:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:01:34,474 INFO L87 Difference]: Start difference. First operand 1811 states and 2057 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:37,967 INFO L93 Difference]: Finished difference Result 2191 states and 2335 transitions. [2024-11-20 17:01:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:01:37,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 17:01:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:37,973 INFO L225 Difference]: With dead ends: 2191 [2024-11-20 17:01:37,974 INFO L226 Difference]: Without dead ends: 2191 [2024-11-20 17:01:37,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:01:37,974 INFO L432 NwaCegarLoop]: 1430 mSDtfsCounter, 701 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:37,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 3067 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-20 17:01:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2024-11-20 17:01:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1807. [2024-11-20 17:01:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1041 states have (on average 1.9490874159462055) internal successors, (2029), 1797 states have internal predecessors, (2029), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2053 transitions. [2024-11-20 17:01:38,009 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2053 transitions. Word has length 27 [2024-11-20 17:01:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:38,009 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2053 transitions. [2024-11-20 17:01:38,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2053 transitions. [2024-11-20 17:01:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 17:01:38,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:38,011 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-20 17:01:38,017 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-20 17:01:38,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:38,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:38,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash 240316858, now seen corresponding path program 1 times [2024-11-20 17:01:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216952135] [2024-11-20 17:01:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:38,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:38,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:38,217 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:38,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 17:01:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:38,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:01:38,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:38,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:38,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:38,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216952135] [2024-11-20 17:01:38,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216952135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:38,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:38,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:01:38,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522943862] [2024-11-20 17:01:38,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:38,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:01:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:38,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:01:38,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:01:38,482 INFO L87 Difference]: Start difference. First operand 1807 states and 2053 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:38,553 INFO L93 Difference]: Finished difference Result 1801 states and 2043 transitions. [2024-11-20 17:01:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:01:38,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-20 17:01:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:38,559 INFO L225 Difference]: With dead ends: 1801 [2024-11-20 17:01:38,560 INFO L226 Difference]: Without dead ends: 1801 [2024-11-20 17:01:38,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:01:38,562 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 21 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5054 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:38,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5054 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:01:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-11-20 17:01:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2024-11-20 17:01:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1035 states have (on average 1.9507246376811593) internal successors, (2019), 1791 states have internal predecessors, (2019), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2043 transitions. [2024-11-20 17:01:38,588 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2043 transitions. Word has length 43 [2024-11-20 17:01:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:38,590 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2043 transitions. [2024-11-20 17:01:38,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2043 transitions. [2024-11-20 17:01:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-20 17:01:38,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:38,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:38,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 17:01:38,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:38,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:38,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1088353786, now seen corresponding path program 1 times [2024-11-20 17:01:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311300520] [2024-11-20 17:01:38,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:38,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:38,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:38,798 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:38,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 17:01:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:38,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:01:38,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:39,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:39,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311300520] [2024-11-20 17:01:39,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311300520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:39,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:01:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884601396] [2024-11-20 17:01:39,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:39,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:01:39,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:01:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:39,242 INFO L87 Difference]: Start difference. First operand 1801 states and 2043 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:39,430 INFO L93 Difference]: Finished difference Result 2199 states and 2478 transitions. [2024-11-20 17:01:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:01:39,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-20 17:01:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:39,437 INFO L225 Difference]: With dead ends: 2199 [2024-11-20 17:01:39,437 INFO L226 Difference]: Without dead ends: 2199 [2024-11-20 17:01:39,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:01:39,438 INFO L432 NwaCegarLoop]: 1781 mSDtfsCounter, 366 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:39,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 3425 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:01:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2024-11-20 17:01:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 1848. [2024-11-20 17:01:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1082 states have (on average 1.9094269870609981) internal successors, (2066), 1838 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2090 transitions. [2024-11-20 17:01:39,470 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2090 transitions. Word has length 51 [2024-11-20 17:01:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:39,470 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2090 transitions. [2024-11-20 17:01:39,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2090 transitions. [2024-11-20 17:01:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 17:01:39,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:39,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:39,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:39,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -546976181, now seen corresponding path program 1 times [2024-11-20 17:01:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:39,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840701575] [2024-11-20 17:01:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:39,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:39,680 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:39,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 17:01:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:39,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 17:01:39,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:39,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:01:39,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:01:40,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 17:01:40,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 17:01:40,501 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 17:01:40,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 17:01:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:40,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:40,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840701575] [2024-11-20 17:01:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840701575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:01:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423060330] [2024-11-20 17:01:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:40,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:01:40,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:01:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:01:40,522 INFO L87 Difference]: Start difference. First operand 1848 states and 2090 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:42,722 INFO L93 Difference]: Finished difference Result 1764 states and 2006 transitions. [2024-11-20 17:01:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:01:42,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-20 17:01:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:42,727 INFO L225 Difference]: With dead ends: 1764 [2024-11-20 17:01:42,727 INFO L226 Difference]: Without dead ends: 1764 [2024-11-20 17:01:42,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:01:42,728 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 2256 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2267 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:42,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2267 Valid, 1040 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 17:01:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-11-20 17:01:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1587. [2024-11-20 17:01:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 905 states have (on average 1.825414364640884) internal successors, (1652), 1577 states have internal predecessors, (1652), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1676 transitions. [2024-11-20 17:01:42,751 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1676 transitions. Word has length 54 [2024-11-20 17:01:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:42,752 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 1676 transitions. [2024-11-20 17:01:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1676 transitions. [2024-11-20 17:01:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 17:01:42,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:42,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:42,765 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-20 17:01:42,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:42,954 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:42,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash 206433881, now seen corresponding path program 1 times [2024-11-20 17:01:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586961598] [2024-11-20 17:01:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:42,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:42,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:42,958 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:42,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 17:01:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:43,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:01:43,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:43,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:01:43,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:01:43,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 17:01:43,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-20 17:01:43,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:43,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586961598] [2024-11-20 17:01:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586961598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:01:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601454797] [2024-11-20 17:01:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:01:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:01:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:01:43,285 INFO L87 Difference]: Start difference. First operand 1587 states and 1676 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:46,008 INFO L93 Difference]: Finished difference Result 1586 states and 1675 transitions. [2024-11-20 17:01:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:01:46,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-20 17:01:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:46,014 INFO L225 Difference]: With dead ends: 1586 [2024-11-20 17:01:46,014 INFO L226 Difference]: Without dead ends: 1586 [2024-11-20 17:01:46,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:01:46,015 INFO L432 NwaCegarLoop]: 1622 mSDtfsCounter, 2 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:46,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4171 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 17:01:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-20 17:01:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2024-11-20 17:01:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 905 states have (on average 1.8243093922651934) internal successors, (1651), 1576 states have internal predecessors, (1651), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1675 transitions. [2024-11-20 17:01:46,037 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1675 transitions. Word has length 59 [2024-11-20 17:01:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:46,037 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 1675 transitions. [2024-11-20 17:01:46,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1675 transitions. [2024-11-20 17:01:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 17:01:46,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:46,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:46,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-20 17:01:46,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:46,243 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:46,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash 206433882, now seen corresponding path program 1 times [2024-11-20 17:01:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:46,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840442980] [2024-11-20 17:01:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:46,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-20 17:01:46,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:46,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:46,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 17:01:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:46,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 17:01:46,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:46,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:01:46,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 17:01:46,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:01:46,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-20 17:01:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:46,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:46,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840442980] [2024-11-20 17:01:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840442980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:46,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:46,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:01:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198978047] [2024-11-20 17:01:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:46,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:01:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:46,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:01:46,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:01:46,624 INFO L87 Difference]: Start difference. First operand 1586 states and 1675 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:49,727 INFO L93 Difference]: Finished difference Result 1585 states and 1674 transitions. [2024-11-20 17:01:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:01:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-20 17:01:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:49,732 INFO L225 Difference]: With dead ends: 1585 [2024-11-20 17:01:49,732 INFO L226 Difference]: Without dead ends: 1585 [2024-11-20 17:01:49,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:01:49,733 INFO L432 NwaCegarLoop]: 1622 mSDtfsCounter, 1 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:49,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4221 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-20 17:01:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-20 17:01:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2024-11-20 17:01:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 904 states have (on average 1.825221238938053) internal successors, (1650), 1575 states have internal predecessors, (1650), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 17:01:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 1674 transitions. [2024-11-20 17:01:49,753 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 1674 transitions. Word has length 59 [2024-11-20 17:01:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:49,753 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 1674 transitions. [2024-11-20 17:01:49,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:01:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1674 transitions. [2024-11-20 17:01:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 17:01:49,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:49,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:49,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-20 17:01:49,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:49,956 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:49,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -433565248, now seen corresponding path program 1 times [2024-11-20 17:01:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:49,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662886304] [2024-11-20 17:01:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:49,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:49,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:49,961 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:49,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 17:01:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:50,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:01:50,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:50,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:01:50,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662886304] [2024-11-20 17:01:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662886304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:01:50,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:01:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:01:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175876340] [2024-11-20 17:01:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:01:50,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:01:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:01:50,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:01:50,246 INFO L87 Difference]: Start difference. First operand 1585 states and 1674 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 17:01:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:50,293 INFO L93 Difference]: Finished difference Result 1588 states and 1679 transitions. [2024-11-20 17:01:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:01:50,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2024-11-20 17:01:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:50,299 INFO L225 Difference]: With dead ends: 1588 [2024-11-20 17:01:50,300 INFO L226 Difference]: Without dead ends: 1588 [2024-11-20 17:01:50,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:01:50,301 INFO L432 NwaCegarLoop]: 1621 mSDtfsCounter, 0 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:50,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4855 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:01:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2024-11-20 17:01:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1588. [2024-11-20 17:01:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 906 states have (on average 1.8245033112582782) internal successors, (1653), 1578 states have internal predecessors, (1653), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-20 17:01:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1679 transitions. [2024-11-20 17:01:50,328 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1679 transitions. Word has length 67 [2024-11-20 17:01:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:50,329 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 1679 transitions. [2024-11-20 17:01:50,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 17:01:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1679 transitions. [2024-11-20 17:01:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 17:01:50,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:50,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:50,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-20 17:01:50,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:50,531 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:50,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:50,531 INFO L85 PathProgramCache]: Analyzing trace with hash -577727650, now seen corresponding path program 1 times [2024-11-20 17:01:50,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:50,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913816576] [2024-11-20 17:01:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:01:50,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:50,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:50,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:50,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 17:01:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:01:50,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:01:50,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:50,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:01:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:50,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:50,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913816576] [2024-11-20 17:01:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913816576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:01:50,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:01:50,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 17:01:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757582925] [2024-11-20 17:01:50,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:01:50,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:01:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:50,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:01:50,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:01:50,888 INFO L87 Difference]: Start difference. First operand 1588 states and 1679 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:01:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:51,066 INFO L93 Difference]: Finished difference Result 1600 states and 1697 transitions. [2024-11-20 17:01:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:01:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-20 17:01:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:51,071 INFO L225 Difference]: With dead ends: 1600 [2024-11-20 17:01:51,072 INFO L226 Difference]: Without dead ends: 1600 [2024-11-20 17:01:51,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-20 17:01:51,073 INFO L432 NwaCegarLoop]: 1620 mSDtfsCounter, 5 mSDsluCounter, 6459 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8079 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:51,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8079 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:01:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2024-11-20 17:01:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1598. [2024-11-20 17:01:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 915 states have (on average 1.8229508196721311) internal successors, (1668), 1587 states have internal predecessors, (1668), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-20 17:01:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1694 transitions. [2024-11-20 17:01:51,096 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1694 transitions. Word has length 68 [2024-11-20 17:01:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:51,096 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 1694 transitions. [2024-11-20 17:01:51,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:01:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1694 transitions. [2024-11-20 17:01:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 17:01:51,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:51,097 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:51,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-20 17:01:51,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:51,298 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:51,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1627731648, now seen corresponding path program 2 times [2024-11-20 17:01:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768608360] [2024-11-20 17:01:51,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:01:51,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:51,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:51,300 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:51,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-20 17:01:51,666 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 17:01:51,666 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:01:51,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 17:01:51,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:51,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:01:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:51,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768608360] [2024-11-20 17:01:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768608360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:01:51,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:01:51,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 17:01:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587766368] [2024-11-20 17:01:51,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:01:51,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 17:01:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:51,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 17:01:51,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 17:01:51,886 INFO L87 Difference]: Start difference. First operand 1598 states and 1694 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:01:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:52,321 INFO L93 Difference]: Finished difference Result 1613 states and 1715 transitions. [2024-11-20 17:01:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 17:01:52,322 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-20 17:01:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:52,326 INFO L225 Difference]: With dead ends: 1613 [2024-11-20 17:01:52,326 INFO L226 Difference]: Without dead ends: 1607 [2024-11-20 17:01:52,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-20 17:01:52,327 INFO L432 NwaCegarLoop]: 1621 mSDtfsCounter, 12 mSDsluCounter, 8085 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9706 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:52,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9706 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:01:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-20 17:01:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2024-11-20 17:01:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 924 states have (on average 1.817099567099567) internal successors, (1679), 1596 states have internal predecessors, (1679), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-20 17:01:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 1705 transitions. [2024-11-20 17:01:52,359 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 1705 transitions. Word has length 71 [2024-11-20 17:01:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:52,359 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 1705 transitions. [2024-11-20 17:01:52,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:01:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1705 transitions. [2024-11-20 17:01:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 17:01:52,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:52,360 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:52,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-20 17:01:52,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:52,561 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:52,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1832776832, now seen corresponding path program 3 times [2024-11-20 17:01:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961779837] [2024-11-20 17:01:52,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:01:52,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:52,566 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:52,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 17:01:53,245 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 17:01:53,245 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:01:53,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 17:01:53,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:53,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:01:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:53,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:53,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961779837] [2024-11-20 17:01:53,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961779837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:01:53,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:01:53,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 17:01:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832563245] [2024-11-20 17:01:53,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:01:53,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 17:01:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 17:01:53,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 17:01:53,865 INFO L87 Difference]: Start difference. First operand 1607 states and 1705 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:01:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:01:55,128 INFO L93 Difference]: Finished difference Result 1631 states and 1744 transitions. [2024-11-20 17:01:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 17:01:55,128 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-11-20 17:01:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:01:55,132 INFO L225 Difference]: With dead ends: 1631 [2024-11-20 17:01:55,132 INFO L226 Difference]: Without dead ends: 1625 [2024-11-20 17:01:55,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 17:01:55,133 INFO L432 NwaCegarLoop]: 1621 mSDtfsCounter, 24 mSDsluCounter, 17786 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 19407 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:01:55,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 19407 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 17:01:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-20 17:01:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1625. [2024-11-20 17:01:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 942 states have (on average 1.8067940552016986) internal successors, (1702), 1614 states have internal predecessors, (1702), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-20 17:01:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1728 transitions. [2024-11-20 17:01:55,153 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1728 transitions. Word has length 77 [2024-11-20 17:01:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:01:55,154 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 1728 transitions. [2024-11-20 17:01:55,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:01:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1728 transitions. [2024-11-20 17:01:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 17:01:55,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:01:55,155 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:01:55,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-20 17:01:55,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:55,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:01:55,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:01:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1197472512, now seen corresponding path program 4 times [2024-11-20 17:01:55,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:01:55,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835452729] [2024-11-20 17:01:55,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 17:01:55,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:01:55,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:01:55,360 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:01:55,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 17:01:55,830 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 17:01:55,830 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:01:55,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 17:01:55,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:01:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:56,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:01:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:01:57,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:01:57,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835452729] [2024-11-20 17:01:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835452729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:01:57,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:01:57,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 17:01:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115184183] [2024-11-20 17:01:57,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:01:57,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 17:01:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:01:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 17:01:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 17:01:57,293 INFO L87 Difference]: Start difference. First operand 1625 states and 1728 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:02:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:02:01,580 INFO L93 Difference]: Finished difference Result 1665 states and 1801 transitions. [2024-11-20 17:02:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 17:02:01,581 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-20 17:02:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:02:01,584 INFO L225 Difference]: With dead ends: 1665 [2024-11-20 17:02:01,584 INFO L226 Difference]: Without dead ends: 1661 [2024-11-20 17:02:01,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 17:02:01,586 INFO L432 NwaCegarLoop]: 1620 mSDtfsCounter, 49 mSDsluCounter, 40398 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 42018 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:02:01,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 42018 Invalid, 2130 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [118 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 17:02:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-11-20 17:02:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1659. [2024-11-20 17:02:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 976 states have (on average 1.790983606557377) internal successors, (1748), 1648 states have internal predecessors, (1748), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-20 17:02:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 1774 transitions. [2024-11-20 17:02:01,612 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 1774 transitions. Word has length 89 [2024-11-20 17:02:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:02:01,612 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 1774 transitions. [2024-11-20 17:02:01,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:02:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1774 transitions. [2024-11-20 17:02:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 17:02:01,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:02:01,614 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:02:01,627 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-20 17:02:01,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:02:01,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-20 17:02:01,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:02:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash 535376960, now seen corresponding path program 5 times [2024-11-20 17:02:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:02:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615585459] [2024-11-20 17:02:01,816 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 17:02:01,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:02:01,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:02:01,817 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:02:01,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-20 17:02:02,913 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-20 17:02:02,913 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:02:02,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-20 17:02:02,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:02:02,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:02:03,027 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-20 17:02:03,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-20 17:02:03,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:02:03,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-20 17:02:04,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:02:04,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-20 17:02:04,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-20 17:02:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 17:02:04,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:02:04,391 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1686) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-20 17:02:04,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:02:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615585459] [2024-11-20 17:02:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615585459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:02:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1755493218] [2024-11-20 17:02:04,393 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 17:02:04,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 17:02:04,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 17:02:04,394 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 17:02:04,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process