./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_06_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_06_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f340a344b0cd8a3eb9dda3d5c47e606d7c41a457465c9271467612d4cde1249d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 17:41:14,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 17:41:14,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 17:41:14,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 17:41:14,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 17:41:14,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 17:41:14,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 17:41:14,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 17:41:14,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 17:41:14,551 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 17:41:14,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 17:41:14,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 17:41:14,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 17:41:14,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 17:41:14,552 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 17:41:14,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 17:41:14,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 17:41:14,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 17:41:14,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 17:41:14,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 17:41:14,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 17:41:14,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 17:41:14,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:41:14,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 17:41:14,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 17:41:14,554 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 17:41:14,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 17:41:14,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 17:41:14,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 17:41:14,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 17:41:14,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 17:41:14,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 17:41:14,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 17:41:14,555 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f340a344b0cd8a3eb9dda3d5c47e606d7c41a457465c9271467612d4cde1249d [2025-03-17 17:41:14,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 17:41:14,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 17:41:14,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 17:41:14,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 17:41:14,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 17:41:14,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_06_good.i [2025-03-17 17:41:15,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d71723c/7543327b88434c1b8ef380f0a4505488/FLAGcbf3ce8f0 [2025-03-17 17:41:16,324 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 17:41:16,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_06_good.i [2025-03-17 17:41:16,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d71723c/7543327b88434c1b8ef380f0a4505488/FLAGcbf3ce8f0 [2025-03-17 17:41:16,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d71723c/7543327b88434c1b8ef380f0a4505488 [2025-03-17 17:41:16,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 17:41:16,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 17:41:16,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 17:41:16,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 17:41:16,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 17:41:16,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:41:16" (1/1) ... [2025-03-17 17:41:16,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c442c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:16, skipping insertion in model container [2025-03-17 17:41:16,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:41:16" (1/1) ... [2025-03-17 17:41:16,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 17:41:17,321 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:629) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:3127) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1658) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1056) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:283) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:791) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:791) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1808) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:233) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1195) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1178) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1839) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:233) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1195) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1178) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1685) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3589) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2572) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:649) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-17 17:41:17,327 INFO L158 Benchmark]: Toolchain (without parser) took 773.89ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 81.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 17:41:17,327 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:41:17,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 772.31ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 81.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 17:41:17,328 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.28ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 772.31ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 81.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:629) 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_06_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f340a344b0cd8a3eb9dda3d5c47e606d7c41a457465c9271467612d4cde1249d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 17:41:18,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 17:41:19,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-17 17:41:19,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 17:41:19,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 17:41:19,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-17 17:41:19,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 17:41:19,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 17:41:19,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 17:41:19,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 17:41:19,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 17:41:19,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 17:41:19,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 17:41:19,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 17:41:19,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 17:41:19,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 17:41:19,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 17:41:19,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 17:41:19,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 17:41:19,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 17:41:19,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 17:41:19,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 17:41:19,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 17:41:19,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 17:41:19,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:41:19,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 17:41:19,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f340a344b0cd8a3eb9dda3d5c47e606d7c41a457465c9271467612d4cde1249d [2025-03-17 17:41:19,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 17:41:19,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 17:41:19,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 17:41:19,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 17:41:19,337 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 17:41:19,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_06_good.i [2025-03-17 17:41:20,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902e0c6f5/8996e6f14746424884137114f1977ad2/FLAG975cd59a8 [2025-03-17 17:41:20,788 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 17:41:20,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_06_good.i [2025-03-17 17:41:20,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902e0c6f5/8996e6f14746424884137114f1977ad2/FLAG975cd59a8 [2025-03-17 17:41:20,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902e0c6f5/8996e6f14746424884137114f1977ad2 [2025-03-17 17:41:20,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 17:41:20,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 17:41:20,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 17:41:20,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 17:41:20,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 17:41:20,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:41:20" (1/1) ... [2025-03-17 17:41:20,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59628716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:20, skipping insertion in model container [2025-03-17 17:41:20,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:41:20" (1/1) ... [2025-03-17 17:41:20,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 17:41:21,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 17:41:21,672 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 17:41:21,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 17:41:22,019 INFO L204 MainTranslator]: Completed translation [2025-03-17 17:41:22,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22 WrapperNode [2025-03-17 17:41:22,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 17:41:22,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 17:41:22,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 17:41:22,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 17:41:22,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,074 INFO L138 Inliner]: procedures = 944, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2025-03-17 17:41:22,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 17:41:22,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 17:41:22,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 17:41:22,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 17:41:22,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,110 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 17:41:22,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 17:41:22,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 17:41:22,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 17:41:22,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 17:41:22,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (1/1) ... [2025-03-17 17:41:22,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:41:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:41:22,172 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) [2025-03-17 17:41:22,177 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 [2025-03-17 17:41:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 17:41:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 17:41:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 17:41:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 17:41:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 17:41:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 17:41:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 17:41:22,329 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 17:41:22,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 17:41:28,754 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-17 17:41:28,754 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 17:41:28,764 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 17:41:28,764 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 17:41:28,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:41:28 BoogieIcfgContainer [2025-03-17 17:41:28,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 17:41:28,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 17:41:28,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 17:41:28,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 17:41:28,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:41:20" (1/3) ... [2025-03-17 17:41:28,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d36209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:41:28, skipping insertion in model container [2025-03-17 17:41:28,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:22" (2/3) ... [2025-03-17 17:41:28,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d36209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:41:28, skipping insertion in model container [2025-03-17 17:41:28,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:41:28" (3/3) ... [2025-03-17 17:41:28,771 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_square_06_good.i [2025-03-17 17:41:28,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 17:41:28,784 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_max_square_06_good.i that has 3 procedures, 62 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-17 17:41:28,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 17:41:28,831 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=LoopHeads, 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;@304d50aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 17:41:28,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 17:41:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 53 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 17:41:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 17:41:28,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:41:28,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:28,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 17:41:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:41:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 107876886, now seen corresponding path program 1 times [2025-03-17 17:41:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 17:41:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056295347] [2025-03-17 17:41:28,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:41:28,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:41:28,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:41:28,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:41:28,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 17:41:28,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 17:41:28,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 17:41:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:41:28,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:41:28,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 17:41:28,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:41:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 17:41:28,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:41:28,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 17:41:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056295347] [2025-03-17 17:41:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056295347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:41:29,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:41:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:41:29,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553883085] [2025-03-17 17:41:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:41:29,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:41:29,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 17:41:29,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:41:29,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:41:29,016 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 53 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2025-03-17 17:41:33,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 17:41:37,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 17:41:41,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 17:41:42,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 17:41:43,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 17:41:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:41:43,581 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2025-03-17 17:41:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:41:43,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-03-17 17:41:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:41:43,586 INFO L225 Difference]: With dead ends: 116 [2025-03-17 17:41:43,587 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 17:41:43,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:41:43,589 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-03-17 17:41:43,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 204 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2025-03-17 17:41:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 17:41:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2025-03-17 17:41:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.542857142857143) internal successors, (54), 47 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 17:41:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-03-17 17:41:43,618 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 11 [2025-03-17 17:41:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:41:43,620 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-03-17 17:41:43,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2025-03-17 17:41:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-03-17 17:41:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 17:41:43,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:41:43,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:43,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 17:41:43,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:41:43,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 17:41:43,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:41:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash 590473204, now seen corresponding path program 1 times [2025-03-17 17:41:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 17:41:43,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948066804] [2025-03-17 17:41:43,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:41:43,823 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 [2025-03-17 17:41:43,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 17:41:43,825 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) [2025-03-17 17:41:43,826 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 [2025-03-17 17:41:43,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 17:41:43,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 17:41:43,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:41:43,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:41:43,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 17:41:43,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:41:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 17:41:43,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:41:43,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 17:41:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948066804] [2025-03-17 17:41:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948066804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:41:43,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:41:43,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 17:41:43,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729646007] [2025-03-17 17:41:43,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:41:43,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:41:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 17:41:43,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:41:43,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:41:43,961 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 17:41:45,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 17:41:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:41:46,054 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2025-03-17 17:41:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:41:46,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-17 17:41:46,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:41:46,055 INFO L225 Difference]: With dead ends: 105 [2025-03-17 17:41:46,055 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 17:41:46,056 INFO L434 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 [2025-03-17 17:41:46,056 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 17:41:46,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 194 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 17:41:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 17:41:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2025-03-17 17:41:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 51 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 17:41:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2025-03-17 17:41:46,062 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 13 [2025-03-17 17:41:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:41:46,062 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2025-03-17 17:41:46,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 17:41:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2025-03-17 17:41:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 17:41:46,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:41:46,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:46,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 17:41:46,267 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 [2025-03-17 17:41:46,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 17:41:46,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:41:46,267 INFO L85 PathProgramCache]: Analyzing trace with hash 619102355, now seen corresponding path program 1 times [2025-03-17 17:41:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 17:41:46,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500506289] [2025-03-17 17:41:46,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:41:46,268 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 [2025-03-17 17:41:46,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 17:41:46,270 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) [2025-03-17 17:41:46,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 17:41:46,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 17:41:46,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 17:41:46,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:41:46,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:41:46,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:41:46,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:41:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 17:41:46,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:41:46,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 17:41:46,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500506289] [2025-03-17 17:41:46,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500506289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:41:46,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:41:46,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:41:46,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097402556] [2025-03-17 17:41:46,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:41:46,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:41:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 17:41:46,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:41:46,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:41:46,343 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 17:41:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:41:46,382 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2025-03-17 17:41:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:41:46,383 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-17 17:41:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:41:46,383 INFO L225 Difference]: With dead ends: 110 [2025-03-17 17:41:46,383 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 17:41:46,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:41:46,384 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:41:46,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 104 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:41:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 17:41:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 17:41:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 39 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 17:41:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-17 17:41:46,389 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 13 [2025-03-17 17:41:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:41:46,389 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-17 17:41:46,389 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), 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) [2025-03-17 17:41:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-17 17:41:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 17:41:46,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:41:46,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:46,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 17:41:46,590 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 [2025-03-17 17:41:46,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 17:41:46,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:41:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 333233768, now seen corresponding path program 1 times [2025-03-17 17:41:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 17:41:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325304629] [2025-03-17 17:41:46,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:41:46,591 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 [2025-03-17 17:41:46,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 17:41:46,594 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) [2025-03-17 17:41:46,594 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 [2025-03-17 17:41:46,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 17:41:46,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 17:41:46,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:41:46,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:41:46,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:41:46,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:41:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 17:41:46,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:41:46,655 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 17:41:46,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325304629] [2025-03-17 17:41:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325304629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:41:46,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:41:46,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:41:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030853812] [2025-03-17 17:41:46,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:41:46,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:41:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 17:41:46,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:41:46,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:41:46,657 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 17:41:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:41:46,743 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2025-03-17 17:41:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:41:46,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-17 17:41:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:41:46,744 INFO L225 Difference]: With dead ends: 65 [2025-03-17 17:41:46,744 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 17:41:46,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:41:46,744 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 17:41:46,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 17:41:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 17:41:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-17 17:41:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:41:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-03-17 17:41:46,749 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 22 [2025-03-17 17:41:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:41:46,749 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-03-17 17:41:46,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 17:41:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-03-17 17:41:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 17:41:46,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:41:46,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:46,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 17:41:46,950 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 [2025-03-17 17:41:46,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 17:41:46,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:41:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1884869054, now seen corresponding path program 1 times [2025-03-17 17:41:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 17:41:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778725429] [2025-03-17 17:41:46,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:41:46,951 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 [2025-03-17 17:41:46,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 17:41:46,953 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) [2025-03-17 17:41:46,954 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 [2025-03-17 17:41:46,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 17:41:47,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 17:41:47,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:41:47,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:41:47,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 17:41:47,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:41:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 17:41:47,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:41:47,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 17:41:47,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778725429] [2025-03-17 17:41:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778725429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:41:47,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:41:47,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 17:41:47,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205796196] [2025-03-17 17:41:47,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:41:47,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:41:47,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 17:41:47,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:41:47,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:41:47,059 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 17:41:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:41:47,128 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2025-03-17 17:41:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:41:47,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-17 17:41:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:41:47,131 INFO L225 Difference]: With dead ends: 70 [2025-03-17 17:41:47,131 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 17:41:47,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:41:47,131 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 17:41:47,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 107 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 17:41:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 17:41:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-17 17:41:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 35 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:41:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-03-17 17:41:47,135 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2025-03-17 17:41:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:41:47,135 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-03-17 17:41:47,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 17:41:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-03-17 17:41:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 17:41:47,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:41:47,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:47,141 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 [2025-03-17 17:41:47,336 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 [2025-03-17 17:41:47,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 17:41:47,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:41:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1697769310, now seen corresponding path program 1 times [2025-03-17 17:41:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 17:41:47,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74763668] [2025-03-17 17:41:47,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:41:47,337 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 [2025-03-17 17:41:47,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 17:41:47,339 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) [2025-03-17 17:41:47,340 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 [2025-03-17 17:41:47,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 17:41:47,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 17:41:47,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:41:47,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:41:47,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 17:41:47,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:41:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 17:41:47,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:41:47,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 17:41:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74763668] [2025-03-17 17:41:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74763668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:41:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:41:47,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 17:41:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686296265] [2025-03-17 17:41:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:41:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:41:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 17:41:47,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:41:47,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:41:47,449 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 17:41:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:41:47,470 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-03-17 17:41:47,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:41:47,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-17 17:41:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:41:47,471 INFO L225 Difference]: With dead ends: 42 [2025-03-17 17:41:47,472 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 17:41:47,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:41:47,473 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:41:47,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 106 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:41:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 17:41:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 17:41:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:41:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-17 17:41:47,476 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 25 [2025-03-17 17:41:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:41:47,476 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-17 17:41:47,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 17:41:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-17 17:41:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 17:41:47,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:41:47,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:47,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 17:41:47,677 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 [2025-03-17 17:41:47,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 17:41:47,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:41:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 410087132, now seen corresponding path program 1 times [2025-03-17 17:41:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 17:41:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478690095] [2025-03-17 17:41:47,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:41:47,678 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 [2025-03-17 17:41:47,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 17:41:47,680 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) [2025-03-17 17:41:47,682 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 [2025-03-17 17:41:47,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 17:41:47,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 17:41:47,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:41:47,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:41:47,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:41:47,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:41:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 17:41:47,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:41:47,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 17:41:47,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478690095] [2025-03-17 17:41:47,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478690095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:41:47,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:41:47,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:41:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781439739] [2025-03-17 17:41:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:41:47,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:41:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 17:41:47,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:41:47,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:41:47,776 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 17:41:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:41:47,837 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-17 17:41:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:41:47,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-03-17 17:41:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:41:47,838 INFO L225 Difference]: With dead ends: 39 [2025-03-17 17:41:47,838 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 17:41:47,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:41:47,838 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 17:41:47,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 17:41:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 17:41:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 17:41:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:41:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-03-17 17:41:47,841 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2025-03-17 17:41:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:41:47,842 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-03-17 17:41:47,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 17:41:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-03-17 17:41:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 17:41:47,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:41:47,842 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:47,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 17:41:48,045 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 [2025-03-17 17:41:48,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 17:41:48,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:41:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash -758037386, now seen corresponding path program 1 times [2025-03-17 17:41:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 17:41:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354255702] [2025-03-17 17:41:48,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:41:48,046 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 [2025-03-17 17:41:48,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 17:41:48,047 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) [2025-03-17 17:41:48,048 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 [2025-03-17 17:41:48,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 17:41:48,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 17:41:48,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:41:48,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:41:48,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:41:48,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:41:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 17:41:48,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:41:48,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 17:41:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354255702] [2025-03-17 17:41:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354255702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:41:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:41:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:41:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630625292] [2025-03-17 17:41:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:41:48,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:41:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 17:41:48,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:41:48,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:41:48,165 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 17:41:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:41:48,207 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-03-17 17:41:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:41:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-17 17:41:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:41:48,213 INFO L225 Difference]: With dead ends: 37 [2025-03-17 17:41:48,213 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 17:41:48,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:41:48,215 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:41:48,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:41:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 17:41:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 17:41:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-03-17 17:41:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 17:41:48,215 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2025-03-17 17:41:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:41:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 17:41:48,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 17:41:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 17:41:48,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 17:41:48,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-17 17:41:48,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-17 17:41:48,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 17:41:48,418 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 [2025-03-17 17:41:48,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:41:48,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 17:41:48,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 17:41:48,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:41:48 BoogieIcfgContainer [2025-03-17 17:41:48,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 17:41:48,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 17:41:48,460 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 17:41:48,460 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 17:41:48,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:41:28" (3/4) ... [2025-03-17 17:41:48,462 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 17:41:48,465 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 17:41:48,465 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 17:41:48,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 17:41:48,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 17:41:48,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 17:41:48,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 17:41:48,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 17:41:48,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 17:41:48,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 17:41:48,545 INFO L158 Benchmark]: Toolchain (without parser) took 27714.02ms. Allocated memory is still 117.4MB. Free memory was 87.8MB in the beginning and 40.2MB in the end (delta: 47.6MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2025-03-17 17:41:48,545 INFO L158 Benchmark]: CDTParser took 1.66ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:41:48,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1187.71ms. Allocated memory is still 117.4MB. Free memory was 87.6MB in the beginning and 61.8MB in the end (delta: 25.8MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2025-03-17 17:41:48,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.78ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 57.7MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 17:41:48,546 INFO L158 Benchmark]: Boogie Preprocessor took 58.91ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 55.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:41:48,546 INFO L158 Benchmark]: IcfgBuilder took 6629.46ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 38.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 17:41:48,546 INFO L158 Benchmark]: TraceAbstraction took 19692.85ms. Allocated memory is still 117.4MB. Free memory was 37.4MB in the beginning and 47.4MB in the end (delta: -10.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:41:48,546 INFO L158 Benchmark]: Witness Printer took 84.86ms. Allocated memory is still 117.4MB. Free memory was 47.4MB in the beginning and 40.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 17:41:48,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1187.71ms. Allocated memory is still 117.4MB. Free memory was 87.6MB in the beginning and 61.8MB in the end (delta: 25.8MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.78ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 57.7MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.91ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 55.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 6629.46ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 38.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19692.85ms. Allocated memory is still 117.4MB. Free memory was 37.4MB in the beginning and 47.4MB in the end (delta: -10.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 84.86ms. Allocated memory is still 117.4MB. Free memory was 47.4MB in the beginning and 40.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1910]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1910]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1894]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1894]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1870]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1870]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1868]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1849]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1849]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1847]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 62 locations, 92 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 16.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 928 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 396 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 5 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 17:41:48,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE