./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbfc84775d165ba071925cc295d45b37e6e48fdc14a38c03379a9274950a3653 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:28:41,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:28:41,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:28:41,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:28:41,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:28:41,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:28:41,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:28:41,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:28:41,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:28:41,481 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:28:41,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:28:41,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:28:41,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:28:41,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:28:41,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:28:41,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:28:41,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:28:41,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:28:41,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:28:41,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:28:41,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:28:41,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:28:41,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:28:41,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:28:41,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:28:41,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:28:41,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:28:41,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:28:41,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:28:41,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:28:41,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:28:41,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:28:41,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:28:41,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:28:41,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:28:41,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:28:41,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:28:41,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:28:41,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:28:41,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:28:41,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:28:41,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:28:41,496 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbfc84775d165ba071925cc295d45b37e6e48fdc14a38c03379a9274950a3653 [2024-10-14 00:28:41,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:28:41,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:28:41,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:28:41,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:28:41,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:28:41,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2024-10-14 00:28:43,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:28:43,706 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:28:43,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2024-10-14 00:28:43,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff62e1698/bb5be20136f941c4ad397f0955065ec9/FLAG8b8abc110 [2024-10-14 00:28:43,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff62e1698/bb5be20136f941c4ad397f0955065ec9 [2024-10-14 00:28:43,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:28:43,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:28:43,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:28:43,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:28:43,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:28:43,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:43" (1/1) ... [2024-10-14 00:28:43,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a33f20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:43, skipping insertion in model container [2024-10-14 00:28:43,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:43" (1/1) ... [2024-10-14 00:28:43,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:28:44,312 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: fesetround not supported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructBuiltinFesetround(IntegerTranslation.java:719) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleBuiltinFesetround(StandardFunctionHandler.java:2408) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:253) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1586) 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:1494) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:224) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1150) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1133) 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:387) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1613) 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:3471) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2497) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:639) 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) [2024-10-14 00:28:44,319 INFO L158 Benchmark]: Toolchain (without parser) took 568.38ms. Allocated memory is still 138.4MB. Free memory was 81.4MB in the beginning and 67.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 00:28:44,320 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 138.4MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:28:44,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.15ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 67.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 00:28:44,321 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.18ms. Allocated memory is still 138.4MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.15ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 67.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: fesetround not supported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: fesetround not supported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructBuiltinFesetround(IntegerTranslation.java:719) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbfc84775d165ba071925cc295d45b37e6e48fdc14a38c03379a9274950a3653 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:28:46,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:28:46,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 00:28:46,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:28:46,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:28:46,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:28:46,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:28:46,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:28:46,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:28:46,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:28:46,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:28:46,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:28:46,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:28:46,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:28:46,703 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:28:46,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:28:46,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:28:46,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:28:46,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:28:46,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:28:46,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:28:46,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:28:46,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:28:46,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 00:28:46,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 00:28:46,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:28:46,712 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 00:28:46,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:28:46,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:28:46,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:28:46,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:28:46,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:28:46,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:28:46,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:28:46,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:28:46,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:28:46,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:28:46,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:28:46,718 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 00:28:46,718 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 00:28:46,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:28:46,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:28:46,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:28:46,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:28:46,720 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 00:28:46,720 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbfc84775d165ba071925cc295d45b37e6e48fdc14a38c03379a9274950a3653 [2024-10-14 00:28:47,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:28:47,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:28:47,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:28:47,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:28:47,116 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:28:47,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2024-10-14 00:28:48,815 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:28:49,096 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:28:49,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2024-10-14 00:28:49,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ab4dae5/a6d1d8a99d914172999e4b0aeca44e9c/FLAGecc565af6 [2024-10-14 00:28:49,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ab4dae5/a6d1d8a99d914172999e4b0aeca44e9c [2024-10-14 00:28:49,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:28:49,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:28:49,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:28:49,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:28:49,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:28:49,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:49" (1/1) ... [2024-10-14 00:28:49,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ec7641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:49, skipping insertion in model container [2024-10-14 00:28:49,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:49" (1/1) ... [2024-10-14 00:28:49,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:28:50,030 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i[42829,42842] [2024-10-14 00:28:50,039 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i[42946,42959] [2024-10-14 00:28:50,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:28:50,064 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:28:50,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma STDC FENV_ACCESS OFF [1095] [2024-10-14 00:28:50,124 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i[42829,42842] [2024-10-14 00:28:50,126 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i[42946,42959] [2024-10-14 00:28:50,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:28:50,269 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:28:50,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50 WrapperNode [2024-10-14 00:28:50,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:28:50,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:28:50,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:28:50,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:28:50,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,337 INFO L138 Inliner]: procedures = 461, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-10-14 00:28:50,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:28:50,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:28:50,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:28:50,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:28:50,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,379 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 00:28:50,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:28:50,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:28:50,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:28:50,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:28:50,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (1/1) ... [2024-10-14 00:28:50,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:28:50,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:28:50,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 00:28:50,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 00:28:50,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 00:28:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure roundingTest [2024-10-14 00:28:50,511 INFO L138 BoogieDeclarations]: Found implementation of procedure roundingTest [2024-10-14 00:28:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:28:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:28:50,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:28:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 00:28:50,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 00:28:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-10-14 00:28:50,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-10-14 00:28:50,672 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:28:50,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:28:50,900 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 00:28:50,900 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:28:50,925 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:28:50,926 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 00:28:50,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:50 BoogieIcfgContainer [2024-10-14 00:28:50,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:28:50,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:28:50,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:28:50,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:28:50,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:28:49" (1/3) ... [2024-10-14 00:28:50,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a81fc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:50, skipping insertion in model container [2024-10-14 00:28:50,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:50" (2/3) ... [2024-10-14 00:28:50,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a81fc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:50, skipping insertion in model container [2024-10-14 00:28:50,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:50" (3/3) ... [2024-10-14 00:28:50,935 INFO L112 eAbstractionObserver]: Analyzing ICFG float-rounding1.i [2024-10-14 00:28:50,951 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:28:50,951 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 00:28:51,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:28:51,031 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;@42b56a08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:28:51,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 00:28:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 00:28:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 00:28:51,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:28:51,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:28:51,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:28:51,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:28:51,054 INFO L85 PathProgramCache]: Analyzing trace with hash 473139210, now seen corresponding path program 1 times [2024-10-14 00:28:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:28:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115319128] [2024-10-14 00:28:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:28:51,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:51,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:28:51,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:28:51,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 00:28:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:28:51,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:28:51,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:28:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:28:51,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:28:51,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:28:51,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115319128] [2024-10-14 00:28:51,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115319128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:28:51,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:28:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:28:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229900725] [2024-10-14 00:28:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:28:51,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:28:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:28:51,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:28:51,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:28:51,282 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:28:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:28:51,332 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2024-10-14 00:28:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:28:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-14 00:28:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:28:51,345 INFO L225 Difference]: With dead ends: 62 [2024-10-14 00:28:51,345 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 00:28:51,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:28:51,352 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:28:51,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:28:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 00:28:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 00:28:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 00:28:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-14 00:28:51,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2024-10-14 00:28:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:28:51,387 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-14 00:28:51,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:28:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-14 00:28:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 00:28:51,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:28:51,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:28:51,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 00:28:51,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:51,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:28:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:28:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1185516445, now seen corresponding path program 1 times [2024-10-14 00:28:51,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:28:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255744290] [2024-10-14 00:28:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:28:51,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:51,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:28:51,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:28:51,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 00:28:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:28:51,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 00:28:51,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:28:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:28:52,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:28:52,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:28:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255744290] [2024-10-14 00:28:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255744290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:28:52,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:28:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 00:28:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322956701] [2024-10-14 00:28:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:28:52,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 00:28:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:28:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 00:28:52,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:28:52,105 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:28:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:28:53,276 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2024-10-14 00:28:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 00:28:53,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 00:28:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:28:53,279 INFO L225 Difference]: With dead ends: 80 [2024-10-14 00:28:53,280 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 00:28:53,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-14 00:28:53,281 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 61 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 00:28:53,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 123 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 00:28:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 00:28:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2024-10-14 00:28:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (20), 13 states have call predecessors, (20), 12 states have call successors, (20) [2024-10-14 00:28:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2024-10-14 00:28:53,305 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 11 [2024-10-14 00:28:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:28:53,307 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2024-10-14 00:28:53,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:28:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2024-10-14 00:28:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 00:28:53,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:28:53,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:28:53,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 00:28:53,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:53,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:28:53,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:28:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash -921088443, now seen corresponding path program 1 times [2024-10-14 00:28:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:28:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261916288] [2024-10-14 00:28:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:28:53,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:53,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:28:53,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:28:53,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 00:28:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:28:53,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:28:53,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:28:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:28:53,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:28:53,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:28:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261916288] [2024-10-14 00:28:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261916288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:28:53,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:28:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:28:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275040489] [2024-10-14 00:28:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:28:53,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:28:53,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:28:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:28:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:28:53,587 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:28:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:28:53,648 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2024-10-14 00:28:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:28:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 00:28:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:28:53,650 INFO L225 Difference]: With dead ends: 118 [2024-10-14 00:28:53,650 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 00:28:53,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:28:53,654 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:28:53,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:28:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 00:28:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 00:28:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-14 00:28:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2024-10-14 00:28:53,676 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 12 [2024-10-14 00:28:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:28:53,676 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2024-10-14 00:28:53,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:28:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-10-14 00:28:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 00:28:53,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:28:53,677 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:28:53,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 00:28:53,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:53,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:28:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:28:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash -845925517, now seen corresponding path program 1 times [2024-10-14 00:28:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:28:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119830539] [2024-10-14 00:28:53,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:28:53,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:53,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:28:53,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:28:53,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 00:28:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:28:53,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:28:53,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:28:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:28:53,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:28:53,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:28:53,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119830539] [2024-10-14 00:28:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119830539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:28:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:28:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:28:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345854555] [2024-10-14 00:28:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:28:53,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:28:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:28:53,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:28:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:28:53,988 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:28:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:28:54,063 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2024-10-14 00:28:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:28:54,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-14 00:28:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:28:54,068 INFO L225 Difference]: With dead ends: 95 [2024-10-14 00:28:54,068 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 00:28:54,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:28:54,093 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:28:54,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:28:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 00:28:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 00:28:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-14 00:28:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2024-10-14 00:28:54,116 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 19 [2024-10-14 00:28:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:28:54,116 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2024-10-14 00:28:54,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:28:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-10-14 00:28:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 00:28:54,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:28:54,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:28:54,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 00:28:54,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:54,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:28:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:28:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1157356128, now seen corresponding path program 1 times [2024-10-14 00:28:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:28:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002549446] [2024-10-14 00:28:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:28:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:28:54,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:28:54,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 00:28:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:28:54,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 00:28:54,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:28:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:28:54,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:28:54,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:28:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002549446] [2024-10-14 00:28:54,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002549446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:28:54,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:28:54,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 00:28:54,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442951113] [2024-10-14 00:28:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:28:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 00:28:54,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:28:54,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 00:28:54,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:28:54,803 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:28:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:28:55,662 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-10-14 00:28:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 00:28:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-14 00:28:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:28:55,665 INFO L225 Difference]: With dead ends: 66 [2024-10-14 00:28:55,665 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 00:28:55,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 00:28:55,666 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 00:28:55,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 143 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 00:28:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 00:28:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2024-10-14 00:28:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-14 00:28:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-10-14 00:28:55,679 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 20 [2024-10-14 00:28:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:28:55,679 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-14 00:28:55,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:28:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2024-10-14 00:28:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 00:28:55,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:28:55,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:28:55,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 00:28:55,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:55,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:28:55,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:28:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1214614430, now seen corresponding path program 1 times [2024-10-14 00:28:55,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:28:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156917979] [2024-10-14 00:28:55,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:28:55,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:55,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:28:55,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:28:55,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 00:28:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:28:55,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:28:55,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:28:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:28:55,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:28:55,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:28:55,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156917979] [2024-10-14 00:28:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156917979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:28:55,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:28:55,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:28:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570413269] [2024-10-14 00:28:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:28:55,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:28:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:28:55,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:28:55,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:28:55,979 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:28:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:28:56,010 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2024-10-14 00:28:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:28:56,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-14 00:28:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:28:56,012 INFO L225 Difference]: With dead ends: 81 [2024-10-14 00:28:56,012 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 00:28:56,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:28:56,014 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:28:56,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:28:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 00:28:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-14 00:28:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 00:28:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-10-14 00:28:56,022 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 20 [2024-10-14 00:28:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:28:56,023 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-10-14 00:28:56,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:28:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-10-14 00:28:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 00:28:56,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:28:56,024 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:28:56,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 00:28:56,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:56,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:28:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:28:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 529120432, now seen corresponding path program 1 times [2024-10-14 00:28:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:28:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909188367] [2024-10-14 00:28:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:28:56,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:28:56,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:28:56,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:28:56,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 00:28:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:28:56,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 00:28:56,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:28:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 00:28:57,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:28:57,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:28:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909188367] [2024-10-14 00:28:57,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909188367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:28:57,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:28:57,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 00:28:57,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191527351] [2024-10-14 00:28:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:28:57,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 00:28:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:28:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 00:28:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 00:28:57,691 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 11 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 00:28:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:28:59,929 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-10-14 00:28:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 00:28:59,929 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-10-14 00:28:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:28:59,930 INFO L225 Difference]: With dead ends: 42 [2024-10-14 00:28:59,930 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 00:28:59,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-14 00:28:59,932 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:28:59,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 151 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 00:28:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 00:28:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-14 00:28:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 00:28:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-10-14 00:28:59,946 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 42 [2024-10-14 00:28:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:28:59,947 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-10-14 00:28:59,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 00:28:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-10-14 00:28:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 00:28:59,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:28:59,948 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:28:59,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 00:29:00,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:29:00,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:29:00,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:29:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1242601651, now seen corresponding path program 1 times [2024-10-14 00:29:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:29:00,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546252485] [2024-10-14 00:29:00,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:29:00,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:29:00,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:29:00,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:29:00,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 00:29:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:29:00,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 00:29:00,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:29:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 00:29:01,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:29:01,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:29:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546252485] [2024-10-14 00:29:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546252485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:29:01,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:29:01,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 00:29:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454728899] [2024-10-14 00:29:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:29:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 00:29:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:29:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 00:29:01,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 00:29:01,479 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 00:29:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:29:03,622 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-10-14 00:29:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 00:29:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 51 [2024-10-14 00:29:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:29:03,623 INFO L225 Difference]: With dead ends: 40 [2024-10-14 00:29:03,623 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 00:29:03,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-14 00:29:03,624 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:29:03,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 00:29:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 00:29:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 00:29:03,626 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) [2024-10-14 00:29:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 00:29:03,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2024-10-14 00:29:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:29:03,628 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 00:29:03,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 00:29:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 00:29:03,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 00:29:03,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-14 00:29:03,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-14 00:29:03,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 00:29:03,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:29:03,837 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:29:03,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 00:29:06,131 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:29:06,157 WARN L155 FloydHoareUtils]: Requires clause for ULTIMATE.setCurrentRoundingMode contained old-variable. Original clause: (let ((.cse2 (= |old(currentRoundingMode)| roundTowardNegative)) (.cse0 (and (= currentRoundingMode roundTowardNegative) (not (= ULTIMATE.setCurrentRoundingMode_i (_ bv1024 32))))) (.cse1 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (= |old(currentRoundingMode)| roundNearestTiesToEven))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or (not .cse2) .cse0) (or .cse1 (= ULTIMATE.setCurrentRoundingMode_i (_ bv0 32)) (not .cse3)))) Eliminated clause: (let ((.cse0 (and (= currentRoundingMode roundTowardNegative) (not (= ULTIMATE.setCurrentRoundingMode_i (_ bv1024 32))))) (.cse1 (= currentRoundingMode roundNearestTiesToEven))) (and (or .cse0 .cse1) (exists ((|old(currentRoundingMode)| RoundingMode)) (let ((.cse2 (= |old(currentRoundingMode)| roundTowardNegative)) (.cse3 (= |old(currentRoundingMode)| roundNearestTiesToEven))) (and (or .cse2 .cse3) (or (not .cse2) .cse0) (or .cse1 (= ULTIMATE.setCurrentRoundingMode_i (_ bv0 32)) (not .cse3))))))) [2024-10-14 00:29:06,172 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,173 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-10-14 00:29:06,174 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: i [2024-10-14 00:29:06,175 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,175 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:29:06,175 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:29:06,177 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,177 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-10-14 00:29:06,178 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: i [2024-10-14 00:29:06,178 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,178 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:29:06,178 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: i [2024-10-14 00:29:06,178 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,178 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:29:06,179 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: i [2024-10-14 00:29:06,179 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,179 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:29:06,179 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,179 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-10-14 00:29:06,179 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: i [2024-10-14 00:29:06,179 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: i [2024-10-14 00:29:06,180 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,180 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:29:06,181 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,181 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-10-14 00:29:06,182 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,182 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-10-14 00:29:06,191 WARN L155 FloydHoareUtils]: Requires clause for roundingTest contained old-variable. Original clause: (let ((.cse0 (= |old(currentRoundingMode)| roundNearestTiesToEven)) (.cse1 (= |old(currentRoundingMode)| roundTowardNegative))) (and (or (= currentRoundingMode roundNearestTiesToEven) (not .cse0)) (or (and (exists ((v_subst_3 RoundingMode)) (and (= |roundingTest_#in~f2| ((_ to_fp 8 24) v_subst_3 ((_ to_fp 11 53) v_subst_3 (/ 3.0 33554432.0)))) (= |roundingTest_#in~f1| ((_ to_fp 8 24) v_subst_3 ((_ to_fp 11 53) v_subst_3 1.0))))) .cse0) (and .cse1 (exists ((currentRoundingMode RoundingMode)) (and (fp.lt ((_ to_fp 8 24) currentRoundingMode (/ 12582911.0 140737488355328.0)) |roundingTest_#in~f2|) (fp.lt |roundingTest_#in~f2| ((_ to_fp 8 24) currentRoundingMode (/ 12582913.0 140737488355328.0))) (fp.lt ((_ to_fp 8 24) currentRoundingMode (/ 16777215.0 16777216.0)) |roundingTest_#in~f1|) (fp.lt |roundingTest_#in~f1| ((_ to_fp 8 24) currentRoundingMode (/ 8388609.0 8388608.0))))))) (or (not .cse1) (= currentRoundingMode roundTowardNegative)))) Eliminated clause: (exists ((|old(currentRoundingMode)| RoundingMode)) (let ((.cse0 (= |old(currentRoundingMode)| roundNearestTiesToEven)) (.cse1 (= |old(currentRoundingMode)| roundTowardNegative))) (and (or (= currentRoundingMode roundNearestTiesToEven) (not .cse0)) (or (and (exists ((v_subst_3 RoundingMode)) (and (= |roundingTest_#in~f2| ((_ to_fp 8 24) v_subst_3 ((_ to_fp 11 53) v_subst_3 (/ 3.0 33554432.0)))) (= |roundingTest_#in~f1| ((_ to_fp 8 24) v_subst_3 ((_ to_fp 11 53) v_subst_3 1.0))))) .cse0) (and .cse1 (exists ((currentRoundingMode RoundingMode)) (and (fp.lt ((_ to_fp 8 24) currentRoundingMode (/ 12582911.0 140737488355328.0)) |roundingTest_#in~f2|) (fp.lt |roundingTest_#in~f2| ((_ to_fp 8 24) currentRoundingMode (/ 12582913.0 140737488355328.0))) (fp.lt ((_ to_fp 8 24) currentRoundingMode (/ 16777215.0 16777216.0)) |roundingTest_#in~f1|) (fp.lt |roundingTest_#in~f1| ((_ to_fp 8 24) currentRoundingMode (/ 8388609.0 8388608.0))))))) (or (not .cse1) (= currentRoundingMode roundTowardNegative))))) [2024-10-14 00:29:06,198 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:29:06,202 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-10-14 00:29:06,203 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:29:06,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:29:06 BoogieIcfgContainer [2024-10-14 00:29:06,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:29:06,204 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:29:06,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:29:06,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:29:06,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:50" (3/4) ... [2024-10-14 00:29:06,209 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 00:29:06,214 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2024-10-14 00:29:06,214 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 00:29:06,214 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure roundingTest [2024-10-14 00:29:06,220 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-14 00:29:06,220 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-14 00:29:06,220 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 00:29:06,221 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 00:29:06,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 00:29:06,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 00:29:06,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:29:06,320 INFO L158 Benchmark]: Toolchain (without parser) took 16923.22ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 44.1MB in the beginning and 50.6MB in the end (delta: -6.5MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-10-14 00:29:06,320 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:29:06,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.31ms. Allocated memory is still 65.0MB. Free memory was 43.9MB in the beginning and 28.3MB in the end (delta: 15.6MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-10-14 00:29:06,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.06ms. Allocated memory is still 65.0MB. Free memory was 28.0MB in the beginning and 25.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 00:29:06,321 INFO L158 Benchmark]: Boogie Preprocessor took 64.71ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 25.6MB in the beginning and 56.8MB in the end (delta: -31.3MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-10-14 00:29:06,321 INFO L158 Benchmark]: RCFGBuilder took 519.18ms. Allocated memory is still 79.7MB. Free memory was 56.8MB in the beginning and 43.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 00:29:06,321 INFO L158 Benchmark]: TraceAbstraction took 15274.78ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 22.1MB in the end (delta: 20.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-10-14 00:29:06,321 INFO L158 Benchmark]: Witness Printer took 114.86ms. Allocated memory is still 79.7MB. Free memory was 22.1MB in the beginning and 50.6MB in the end (delta: -28.6MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-10-14 00:29:06,324 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.15ms. Allocated memory is still 50.3MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.31ms. Allocated memory is still 65.0MB. Free memory was 43.9MB in the beginning and 28.3MB in the end (delta: 15.6MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.06ms. Allocated memory is still 65.0MB. Free memory was 28.0MB in the beginning and 25.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.71ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 25.6MB in the beginning and 56.8MB in the end (delta: -31.3MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * RCFGBuilder took 519.18ms. Allocated memory is still 79.7MB. Free memory was 56.8MB in the beginning and 43.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15274.78ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 22.1MB in the end (delta: 20.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Witness Printer took 114.86ms. Allocated memory is still 79.7MB. Free memory was 22.1MB in the beginning and 50.6MB in the end (delta: -28.6MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 1095]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma STDC FENV_ACCESS OFF [1095] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundTowardNegative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: i - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundTowardNegative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: i - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: i - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: i - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundTowardNegative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: i - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: i - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundTowardNegative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundTowardNegative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundTowardNegative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundTowardNegative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 1103]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1110]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 835 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 595 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 408 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 240 mSDtfsCounter, 408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 177 ConstructedInterpolants, 26 QuantifiedInterpolants, 778 SizeOfPredicates, 20 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 69/69 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - ProcedureContractResult [Line: 2]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-10-14 00:29:06,435 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