./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:25:18,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:25:18,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:25:18,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:25:18,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:25:18,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:25:18,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:25:18,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:25:18,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:25:18,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:25:18,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:25:18,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:25:18,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:25:18,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:25:18,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:25:18,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:25:18,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:25:18,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:25:18,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:25:18,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:25:18,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:25:18,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:25:18,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:25:18,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:25:18,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:25:18,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:25:18,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:25:18,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:25:18,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:25:18,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:25:18,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:25:18,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:25:18,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:25:18,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:25:18,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:25:18,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:25:18,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:25:18,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:25:18,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:25:18,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:25:18,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:25:18,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:25:18,866 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-11-09 20:25:19,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:25:19,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:25:19,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:25:19,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:25:19,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:25:19,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2024-11-09 20:25:20,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:25:20,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:25:20,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2024-11-09 20:25:20,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca60f8d5/8652bf441bf54cc184b9da6dc70b4a51/FLAG30c68e96d [2024-11-09 20:25:21,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca60f8d5/8652bf441bf54cc184b9da6dc70b4a51 [2024-11-09 20:25:21,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:25:21,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:25:21,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:25:21,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:25:21,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:25:21,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:25:21" (1/1) ... [2024-11-09 20:25:21,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0d2135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:21, skipping insertion in model container [2024-11-09 20:25:21,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:25:21" (1/1) ... [2024-11-09 20:25:21,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:25:21,663 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:736) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleBuiltinFesetround(StandardFunctionHandler.java:2798) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1611) 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:1516) 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:1167) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1150) 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:388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1638) 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:3519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2508) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:642) 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-11-09 20:25:21,671 INFO L158 Benchmark]: Toolchain (without parser) took 525.35ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 121.4MB in the end (delta: -23.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 20:25:21,672 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 48.1MB in the beginning and 47.9MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:25:21,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.89ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 121.4MB in the end (delta: -23.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 20:25:21,674 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.17ms. Allocated memory is still 94.4MB. Free memory was 48.1MB in the beginning and 47.9MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.89ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 121.4MB in the end (delta: -23.4MB). 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:736) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:25:23,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:25:23,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 20:25:23,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:25:23,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:25:23,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:25:23,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:25:23,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:25:23,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:25:23,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:25:23,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:25:23,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:25:23,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:25:23,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:25:23,829 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:25:23,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:25:23,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:25:23,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:25:23,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:25:23,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:25:23,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:25:23,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:25:23,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:25:23,836 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 20:25:23,837 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 20:25:23,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:25:23,837 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 20:25:23,837 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:25:23,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:25:23,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:25:23,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:25:23,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:25:23,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:25:23,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:25:23,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:25:23,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:25:23,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:25:23,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:25:23,840 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 20:25:23,840 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 20:25:23,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:25:23,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:25:23,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:25:23,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:25:23,842 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-11-09 20:25:24,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:25:24,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:25:24,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:25:24,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:25:24,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:25:24,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2024-11-09 20:25:25,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:25:25,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:25:25,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2024-11-09 20:25:25,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b589a511c/3402f04a66174089be132f1fe733ca86/FLAG1eeeeabaf [2024-11-09 20:25:25,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b589a511c/3402f04a66174089be132f1fe733ca86 [2024-11-09 20:25:25,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:25:26,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:25:26,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:25:26,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:25:26,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:25:26,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:25:25" (1/1) ... [2024-11-09 20:25:26,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8a3313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26, skipping insertion in model container [2024-11-09 20:25:26,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:25:25" (1/1) ... [2024-11-09 20:25:26,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:25:26,554 WARN L250 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-11-09 20:25:26,561 WARN L250 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-11-09 20:25:26,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:25:26,582 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:25:26,591 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma STDC FENV_ACCESS OFF [1095] [2024-11-09 20:25:26,622 WARN L250 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-11-09 20:25:26,627 WARN L250 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-11-09 20:25:26,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:25:26,775 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:25:26,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26 WrapperNode [2024-11-09 20:25:26,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:25:26,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:25:26,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:25:26,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:25:26,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,841 INFO L138 Inliner]: procedures = 461, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-11-09 20:25:26,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:25:26,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:25:26,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:25:26,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:25:26,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,867 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-11-09 20:25:26,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:25:26,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:25:26,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:25:26,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:25:26,895 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (1/1) ... [2024-11-09 20:25:26,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:25:26,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:25:26,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 20:25:26,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 20:25:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 20:25:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure roundingTest [2024-11-09 20:25:26,960 INFO L138 BoogieDeclarations]: Found implementation of procedure roundingTest [2024-11-09 20:25:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:25:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:25:26,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:25:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 20:25:26,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 20:25:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-11-09 20:25:26,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-11-09 20:25:27,057 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:25:27,060 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:25:27,284 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 20:25:27,285 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:25:27,299 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:25:27,300 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:25:27,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:25:27 BoogieIcfgContainer [2024-11-09 20:25:27,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:25:27,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:25:27,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:25:27,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:25:27,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:25:25" (1/3) ... [2024-11-09 20:25:27,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e797f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:25:27, skipping insertion in model container [2024-11-09 20:25:27,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:26" (2/3) ... [2024-11-09 20:25:27,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e797f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:25:27, skipping insertion in model container [2024-11-09 20:25:27,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:25:27" (3/3) ... [2024-11-09 20:25:27,312 INFO L112 eAbstractionObserver]: Analyzing ICFG float-rounding1.i [2024-11-09 20:25:27,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:25:27,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 20:25:27,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:25:27,402 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;@834d92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:25:27,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 20:25:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.375) internal successors, (33), 26 states have internal predecessors, (33), 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-11-09 20:25:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 20:25:27,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:25:27,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:25:27,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:25:27,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:25:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 501177938, now seen corresponding path program 1 times [2024-11-09 20:25:27,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:25:27,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751322044] [2024-11-09 20:25:27,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:25:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:25:27,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:25:27,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 20:25:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:25:27,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:25:27,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:25:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:25:27,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:25:27,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:25:27,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751322044] [2024-11-09 20:25:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751322044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:25:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:25:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:25:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998093498] [2024-11-09 20:25:27,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:25:27,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:25:27,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:25:27,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:25:27,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:25:27,579 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.375) internal successors, (33), 26 states have internal predecessors, (33), 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.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-09 20:25:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:25:27,622 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2024-11-09 20:25:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:25:27,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2024-11-09 20:25:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:25:27,631 INFO L225 Difference]: With dead ends: 69 [2024-11-09 20:25:27,631 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 20:25:27,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:25:27,637 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:25:27,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:25:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 20:25:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 20:25:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 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-11-09 20:25:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 20:25:27,671 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2024-11-09 20:25:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:25:27,672 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 20:25:27,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-09 20:25:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 20:25:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 20:25:27,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:25:27,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:25:27,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 20:25:27,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:27,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:25:27,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:25:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash 34538756, now seen corresponding path program 1 times [2024-11-09 20:25:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:25:27,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473766887] [2024-11-09 20:25:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:25:27,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:25:27,882 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:25:27,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 20:25:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:25:27,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 20:25:27,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:25:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:25:28,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:25:28,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:25:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473766887] [2024-11-09 20:25:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473766887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:25:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:25:28,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 20:25:28,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635096056] [2024-11-09 20:25:28,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:25:28,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 20:25:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:25:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 20:25:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:25:28,310 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 20:25:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:25:29,269 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2024-11-09 20:25:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 20:25:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 20:25:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:25:29,273 INFO L225 Difference]: With dead ends: 81 [2024-11-09 20:25:29,273 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 20:25:29,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-09 20:25:29,275 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 20:25:29,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 20:25:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 20:25:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2024-11-09 20:25:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 42 states have internal predecessors, (52), 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-11-09 20:25:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-11-09 20:25:29,299 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 12 [2024-11-09 20:25:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:25:29,300 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-11-09 20:25:29,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 20:25:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-11-09 20:25:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 20:25:29,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:25:29,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:25:29,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 20:25:29,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:29,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:25:29,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:25:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1002215087, now seen corresponding path program 1 times [2024-11-09 20:25:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:25:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329653221] [2024-11-09 20:25:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:25:29,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:25:29,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:25:29,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 20:25:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:25:29,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:25:29,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:25:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:25:29,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:25:29,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:25:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329653221] [2024-11-09 20:25:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329653221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:25:29,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:25:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:25:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381906907] [2024-11-09 20:25:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:25:29,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:25:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:25:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:25:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:25:29,581 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-09 20:25:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:25:29,610 INFO L93 Difference]: Finished difference Result 119 states and 161 transitions. [2024-11-09 20:25:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:25:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13 [2024-11-09 20:25:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:25:29,612 INFO L225 Difference]: With dead ends: 119 [2024-11-09 20:25:29,612 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 20:25:29,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:25:29,614 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:25:29,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:25:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 20:25:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 20:25:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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-11-09 20:25:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2024-11-09 20:25:29,629 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 13 [2024-11-09 20:25:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:25:29,629 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2024-11-09 20:25:29,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-09 20:25:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-11-09 20:25:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 20:25:29,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:25:29,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:25:29,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 20:25:29,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:29,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:25:29,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:25:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash -417958782, now seen corresponding path program 1 times [2024-11-09 20:25:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:25:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291236679] [2024-11-09 20:25:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:25:29,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:25:29,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:25:29,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 20:25:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:25:29,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:25:29,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:25:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 20:25:29,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:25:29,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:25:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291236679] [2024-11-09 20:25:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291236679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:25:29,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:25:29,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:25:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306398614] [2024-11-09 20:25:29,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:25:29,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:25:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:25:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:25:29,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:25:29,919 INFO L87 Difference]: Start difference. First operand 59 states and 69 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-11-09 20:25:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:25:29,938 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-11-09 20:25:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:25:29,939 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-11-09 20:25:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:25:29,940 INFO L225 Difference]: With dead ends: 96 [2024-11-09 20:25:29,940 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 20:25:29,941 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-11-09 20:25:29,942 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:25:29,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:25:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 20:25:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 20:25:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 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-11-09 20:25:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-11-09 20:25:29,952 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 20 [2024-11-09 20:25:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:25:29,953 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-11-09 20:25:29,953 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-11-09 20:25:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-09 20:25:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 20:25:29,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:25:29,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:25:29,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 20:25:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:30,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:25:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:25:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1884688924, now seen corresponding path program 1 times [2024-11-09 20:25:30,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:25:30,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367237434] [2024-11-09 20:25:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:25:30,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:25:30,157 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:25:30,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 20:25:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:25:30,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 20:25:30,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:25:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 20:25:30,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:25:30,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:25:30,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367237434] [2024-11-09 20:25:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367237434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:25:30,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:25:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 20:25:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90883932] [2024-11-09 20:25:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:25:30,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 20:25:30,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:25:30,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 20:25:30,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:25:30,567 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-11-09 20:25:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:25:31,424 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-09 20:25:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 20:25:31,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 21 [2024-11-09 20:25:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:25:31,426 INFO L225 Difference]: With dead ends: 67 [2024-11-09 20:25:31,426 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 20:25:31,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-09 20:25:31,427 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 20:25:31,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 150 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 20:25:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 20:25:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2024-11-09 20:25:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 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-11-09 20:25:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-11-09 20:25:31,437 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 21 [2024-11-09 20:25:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:25:31,438 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-11-09 20:25:31,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-11-09 20:25:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-11-09 20:25:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 20:25:31,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:25:31,439 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:25:31,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 20:25:31,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:31,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:25:31,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:25:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1856059773, now seen corresponding path program 1 times [2024-11-09 20:25:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:25:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952912286] [2024-11-09 20:25:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:25:31,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:31,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:25:31,642 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:25:31,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 20:25:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:25:31,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:25:31,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:25:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 20:25:31,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:25:31,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:25:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952912286] [2024-11-09 20:25:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952912286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:25:31,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:25:31,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:25:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697128995] [2024-11-09 20:25:31,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:25:31,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:25:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:25:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:25:31,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:25:31,728 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-09 20:25:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:25:31,752 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-09 20:25:31,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:25:31,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2024-11-09 20:25:31,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:25:31,754 INFO L225 Difference]: With dead ends: 82 [2024-11-09 20:25:31,754 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 20:25:31,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:25:31,755 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:25:31,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:25:31,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 20:25:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-09 20:25:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 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-11-09 20:25:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2024-11-09 20:25:31,775 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 21 [2024-11-09 20:25:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:25:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-11-09 20:25:31,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-09 20:25:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-11-09 20:25:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 20:25:31,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:25:31,777 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, 1] [2024-11-09 20:25:31,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 20:25:31,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:31,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:25:31,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:25:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2086114634, now seen corresponding path program 1 times [2024-11-09 20:25:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:25:31,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95001130] [2024-11-09 20:25:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:25:31,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:31,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:25:31,983 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:25:31,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 20:25:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:25:32,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 20:25:32,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:25:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 20:25:33,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:25:33,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:25:33,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95001130] [2024-11-09 20:25:33,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95001130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:25:33,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:25:33,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 20:25:33,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889344916] [2024-11-09 20:25:33,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:25:33,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 20:25:33,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:25:33,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 20:25:33,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 20:25:33,168 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 11 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-11-09 20:25:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:25:34,857 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2024-11-09 20:25:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 20:25:34,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 43 [2024-11-09 20:25:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:25:34,860 INFO L225 Difference]: With dead ends: 43 [2024-11-09 20:25:34,860 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 20:25:34,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-09 20:25:34,861 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 20:25:34,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 179 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 20:25:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 20:25:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-09 20:25:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 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-11-09 20:25:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-09 20:25:34,873 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2024-11-09 20:25:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:25:34,873 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-09 20:25:34,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-11-09 20:25:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-09 20:25:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 20:25:34,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:25:34,879 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, 1] [2024-11-09 20:25:34,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 20:25:35,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:35,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:25:35,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:25:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1629302670, now seen corresponding path program 1 times [2024-11-09 20:25:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:25:35,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001666488] [2024-11-09 20:25:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:25:35,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:35,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:25:35,084 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:25:35,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 20:25:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:25:35,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 20:25:35,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:25:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 20:25:36,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:25:36,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:25:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001666488] [2024-11-09 20:25:36,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001666488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:25:36,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:25:36,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 20:25:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561624140] [2024-11-09 20:25:36,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:25:36,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 20:25:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:25:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 20:25:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 20:25:36,293 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 20:25:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:25:38,136 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-11-09 20:25:38,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 20:25:38,136 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 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 52 [2024-11-09 20:25:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:25:38,137 INFO L225 Difference]: With dead ends: 41 [2024-11-09 20:25:38,137 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 20:25:38,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-09 20:25:38,138 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:25:38,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 199 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 20:25:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 20:25:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 20:25:38,140 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-11-09 20:25:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 20:25:38,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-11-09 20:25:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:25:38,140 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 20:25:38,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 20:25:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 20:25:38,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 20:25:38,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 20:25:38,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 20:25:38,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 20:25:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:25:38,347 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:25:38,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 20:25:40,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 20:25:40,200 WARN L156 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-11-09 20:25:40,216 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 20:25:40,217 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-11-09 20:25:40,219 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 20:25:40,219 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-11-09 20:25:40,221 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN [2024-11-09 20:25:40,222 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE [2024-11-09 20:25:40,222 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO [2024-11-09 20:25:40,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL [2024-11-09 20:25:40,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL [2024-11-09 20:25:40,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ [2024-11-09 20:25:40,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ [2024-11-09 20:25:40,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ [2024-11-09 20:25:40,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ [2024-11-09 20:25:40,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ [2024-11-09 20:25:40,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_INVALID [2024-11-09 20:25:40,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~__FE_DENORM [2024-11-09 20:25:40,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_DIVBYZERO [2024-11-09 20:25:40,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_OVERFLOW [2024-11-09 20:25:40,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_UNDERFLOW [2024-11-09 20:25:40,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_INEXACT [2024-11-09 20:25:40,225 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_TONEAREST [2024-11-09 20:25:40,225 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_DOWNWARD [2024-11-09 20:25:40,225 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_UPWARD [2024-11-09 20:25:40,225 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_TOWARDZERO [2024-11-09 20:25:40,232 WARN L156 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-11-09 20:25:40,238 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 20:25:40,242 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 20:25:40,242 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-11-09 20:25:40,242 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 20:25:40,242 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 20:25:40,242 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundTowardNegative [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL [2024-11-09 20:25:40,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ [2024-11-09 20:25:40,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ [2024-11-09 20:25:40,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ [2024-11-09 20:25:40,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ [2024-11-09 20:25:40,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ [2024-11-09 20:25:40,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_INVALID [2024-11-09 20:25:40,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~__FE_DENORM [2024-11-09 20:25:40,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_DIVBYZERO [2024-11-09 20:25:40,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_OVERFLOW [2024-11-09 20:25:40,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_UNDERFLOW [2024-11-09 20:25:40,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_INEXACT [2024-11-09 20:25:40,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_TONEAREST [2024-11-09 20:25:40,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_DOWNWARD [2024-11-09 20:25:40,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_UPWARD [2024-11-09 20:25:40,247 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_TOWARDZERO [2024-11-09 20:25:40,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:25:40 BoogieIcfgContainer [2024-11-09 20:25:40,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 20:25:40,249 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 20:25:40,249 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 20:25:40,249 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 20:25:40,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:25:27" (3/4) ... [2024-11-09 20:25:40,252 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 20:25:40,255 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2024-11-09 20:25:40,256 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 20:25:40,256 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure roundingTest [2024-11-09 20:25:40,259 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-09 20:25:40,260 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-09 20:25:40,260 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 20:25:40,260 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 20:25:40,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 20:25:40,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 20:25:40,351 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 20:25:40,351 INFO L158 Benchmark]: Toolchain (without parser) took 14350.71ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.2MB in the beginning and 35.8MB in the end (delta: -617.3kB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-11-09 20:25:40,352 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:25:40,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.65ms. Allocated memory is still 67.1MB. Free memory was 34.9MB in the beginning and 39.6MB in the end (delta: -4.7MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-09 20:25:40,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.47ms. Allocated memory is still 67.1MB. Free memory was 39.6MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:25:40,353 INFO L158 Benchmark]: Boogie Preprocessor took 48.03ms. Allocated memory is still 67.1MB. Free memory was 37.1MB in the beginning and 35.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:25:40,353 INFO L158 Benchmark]: IcfgBuilder took 409.05ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.0MB in the beginning and 56.1MB in the end (delta: -21.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-09 20:25:40,353 INFO L158 Benchmark]: TraceAbstraction took 12945.27ms. Allocated memory is still 81.8MB. Free memory was 55.6MB in the beginning and 40.7MB in the end (delta: 14.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-11-09 20:25:40,354 INFO L158 Benchmark]: Witness Printer took 102.11ms. Allocated memory is still 81.8MB. Free memory was 40.7MB in the beginning and 35.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 20:25:40,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.65ms. Allocated memory is still 67.1MB. Free memory was 34.9MB in the beginning and 39.6MB in the end (delta: -4.7MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.47ms. Allocated memory is still 67.1MB. Free memory was 39.6MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.03ms. Allocated memory is still 67.1MB. Free memory was 37.1MB in the beginning and 35.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 409.05ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.0MB in the beginning and 56.1MB in the end (delta: -21.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12945.27ms. Allocated memory is still 81.8MB. Free memory was 55.6MB in the beginning and 40.7MB in the end (delta: 14.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * Witness Printer took 102.11ms. Allocated memory is still 81.8MB. Free memory was 40.7MB in the beginning and 35.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.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: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundTowardNegative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_INVALID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~__FE_DENORM - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_DIVBYZERO - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_OVERFLOW - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_UNDERFLOW - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_INEXACT - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_TONEAREST - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_DOWNWARD - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_UPWARD - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_TOWARDZERO - 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_INVALID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~__FE_DENORM - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_DIVBYZERO - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_OVERFLOW - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_UNDERFLOW - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed2~0~FE_INEXACT - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_TONEAREST - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_DOWNWARD - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_UPWARD - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed3~0~FE_TOWARDZERO * 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: 1110]: 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: 1103]: 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, 36 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 895 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 638 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 257 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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, 2.9s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 185 ConstructedInterpolants, 26 QuantifiedInterpolants, 786 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) && ((signgam == \old(signgam)) && (_LIB_VERSION == \old(_LIB_VERSION)))) - ProcedureContractResult [Line: 1097]: Procedure Contract for roundingTest Derived contract for procedure roundingTest. Ensures: ((signgam == \old(signgam)) && (_LIB_VERSION == \old(_LIB_VERSION))) RESULT: Ultimate proved your program to be correct! [2024-11-09 20:25:40,455 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