./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/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/float-benchs/sqrt_poly.c -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.graphml --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 e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/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/float-benchs/sqrt_poly.c -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.graphml --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 e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ............................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-10-24 22:43:57,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:43:57,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:43:57,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:43:57,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:43:57,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:43:57,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:43:57,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:43:57,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:43:57,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:43:57,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:43:57,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:43:57,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:43:57,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:43:57,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:43:57,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:43:57,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:43:57,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:43:57,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:43:57,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:43:58,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:43:58,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:43:58,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:43:58,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:43:58,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:43:58,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:43:58,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:43:58,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:43:58,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:43:58,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:43:58,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:43:58,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:43:58,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:43:58,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:43:58,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:43:58,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:43:58,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:43:58,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:43:58,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:43:58,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:43:58,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:43:58,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 22:43:58,084 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:43:58,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:43:58,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:43:58,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:43:58,087 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:43:58,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:43:58,088 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:43:58,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 22:43:58,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:43:58,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:43:58,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:43:58,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:43:58,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:43:58,090 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:43:58,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:43:58,090 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:43:58,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:43:58,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:43:58,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:43:58,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:43:58,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:43:58,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:43:58,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:43:58,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:43:58,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:43:58,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 22:43:58,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 22:43:58,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:43:58,094 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:43:58,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2020-10-24 22:43:58,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:43:58,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:43:58,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:43:58,540 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:43:58,543 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:43:58,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-10-24 22:43:58,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3b32e6f/c93e9df3e7b84764843fbe812ea45d9c/FLAG4619e56ee [2020-10-24 22:43:59,309 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:43:59,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-10-24 22:43:59,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3b32e6f/c93e9df3e7b84764843fbe812ea45d9c/FLAG4619e56ee [2020-10-24 22:43:59,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3b32e6f/c93e9df3e7b84764843fbe812ea45d9c [2020-10-24 22:43:59,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:43:59,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:43:59,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:43:59,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:43:59,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:43:59,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:43:59,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1047f298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59, skipping insertion in model container [2020-10-24 22:43:59,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:43:59,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:43:59,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:43:59,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:43:59,923 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:43:59,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:43:59,960 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:43:59,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59 WrapperNode [2020-10-24 22:43:59,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:43:59,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:43:59,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:43:59,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:43:59,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:43:59,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:44:00,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:44:00,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:44:00,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:44:00,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:44:00,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:44:00,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:44:00,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:44:00,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:44:00,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:44:00,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:44:00,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... [2020-10-24 22:44:00,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:44:00,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:44:00,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:44:00,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:44:00,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:44:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 22:44:00,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:44:00,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:44:00,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:44:00,342 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:44:00,343 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-24 22:44:00,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:44:00 BoogieIcfgContainer [2020-10-24 22:44:00,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:44:00,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:44:00,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:44:00,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:44:00,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:43:59" (1/3) ... [2020-10-24 22:44:00,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dcafd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:44:00, skipping insertion in model container [2020-10-24 22:44:00,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:59" (2/3) ... [2020-10-24 22:44:00,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dcafd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:44:00, skipping insertion in model container [2020-10-24 22:44:00,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:44:00" (3/3) ... [2020-10-24 22:44:00,367 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2020-10-24 22:44:00,400 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:44:00,413 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:44:00,452 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:44:00,504 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:44:00,505 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:44:00,505 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:44:00,505 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:44:00,505 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:44:00,505 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:44:00,506 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:44:00,506 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:44:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-10-24 22:44:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 22:44:00,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:44:00,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:44:00,545 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:44:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:44:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2020-10-24 22:44:00,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 22:44:00,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540148796] [2020-10-24 22:44:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 22:44:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:44:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:44:00,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540148796] [2020-10-24 22:44:00,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:44:00,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 22:44:00,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465538777] [2020-10-24 22:44:00,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 22:44:00,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 22:44:00,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 22:44:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 22:44:00,886 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-10-24 22:44:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:44:00,907 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-10-24 22:44:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 22:44:00,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-10-24 22:44:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:44:00,921 INFO L225 Difference]: With dead ends: 22 [2020-10-24 22:44:00,921 INFO L226 Difference]: Without dead ends: 8 [2020-10-24 22:44:00,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 22:44:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-10-24 22:44:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-10-24 22:44:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-24 22:44:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-10-24 22:44:00,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2020-10-24 22:44:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:44:00,982 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-10-24 22:44:00,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 22:44:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-10-24 22:44:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 22:44:00,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:44:00,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:44:00,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 22:44:00,985 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:44:00,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:44:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2020-10-24 22:44:00,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 22:44:00,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014249661] [2020-10-24 22:44:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 22:44:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:44:01,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:44:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:44:01,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:44:01,145 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 22:44:01,146 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 22:44:01,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 22:44:01,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:44:01 BoogieIcfgContainer [2020-10-24 22:44:01,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:44:01,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:44:01,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:44:01,189 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:44:01,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:44:00" (3/4) ... [2020-10-24 22:44:01,194 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 22:44:01,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:44:01,200 INFO L168 Benchmark]: Toolchain (without parser) took 1538.29 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.7 MB in the beginning and 23.3 MB in the end (delta: -1.6 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:44:01,201 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 44.0 MB. Free memory is still 29.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:44:01,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.59 ms. Allocated memory is still 44.0 MB. Free memory was 21.0 MB in the beginning and 22.7 MB in the end (delta: -1.7 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 22:44:01,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 44.0 MB. Free memory was 22.6 MB in the beginning and 21.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:44:01,206 INFO L168 Benchmark]: Boogie Preprocessor took 23.54 ms. Allocated memory is still 44.0 MB. Free memory was 21.1 MB in the beginning and 20.2 MB in the end (delta: 904.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:44:01,208 INFO L168 Benchmark]: RCFGBuilder took 317.65 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.1 MB in the beginning and 30.0 MB in the end (delta: -9.9 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. [2020-10-24 22:44:01,210 INFO L168 Benchmark]: TraceAbstraction took 840.34 ms. Allocated memory is still 54.5 MB. Free memory was 29.4 MB in the beginning and 23.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2020-10-24 22:44:01,211 INFO L168 Benchmark]: Witness Printer took 6.54 ms. Allocated memory is still 54.5 MB. Free memory was 23.5 MB in the beginning and 23.3 MB in the end (delta: 265.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:44:01,227 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 44.0 MB. Free memory is still 29.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 295.59 ms. Allocated memory is still 44.0 MB. Free memory was 21.0 MB in the beginning and 22.7 MB in the end (delta: -1.7 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 44.0 MB. Free memory was 22.6 MB in the beginning and 21.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.54 ms. Allocated memory is still 44.0 MB. Free memory was 21.1 MB in the beginning and 20.2 MB in the end (delta: 904.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 317.65 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.1 MB in the beginning and 30.0 MB in the end (delta: -9.9 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 840.34 ms. Allocated memory is still 54.5 MB. Free memory was 29.4 MB in the beginning and 23.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. * Witness Printer took 6.54 ms. Allocated memory is still 54.5 MB. Free memory was 23.5 MB in the beginning and 23.3 MB in the end (delta: 265.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L14] COND FALSE !(!cond) VAL [sqrt2=11863283/8388608] [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L3] __assert_fail("0", "sqrt_poly.c", 3, "reach_error") VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-10-24 22:44:04,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:44:04,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:44:04,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:44:04,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:44:04,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:44:04,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:44:04,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:44:04,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:44:04,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:44:04,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:44:04,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:44:04,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:44:04,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:44:04,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:44:04,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:44:04,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:44:04,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:44:04,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:44:04,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:44:04,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:44:04,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:44:04,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:44:04,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:44:04,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:44:04,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:44:04,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:44:04,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:44:04,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:44:04,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:44:04,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:44:04,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:44:04,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:44:04,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:44:04,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:44:04,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:44:04,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:44:04,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:44:04,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:44:04,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:44:04,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:44:04,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 22:44:04,317 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:44:04,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:44:04,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:44:04,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:44:04,323 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:44:04,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:44:04,324 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:44:04,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:44:04,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:44:04,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:44:04,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:44:04,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:44:04,327 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 22:44:04,327 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 22:44:04,327 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:44:04,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:44:04,328 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:44:04,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:44:04,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:44:04,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:44:04,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:44:04,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:44:04,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:44:04,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:44:04,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:44:04,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:44:04,330 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 22:44:04,331 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 22:44:04,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:44:04,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:44:04,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 22:44:04,332 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2020-10-24 22:44:04,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:44:04,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:44:04,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:44:04,858 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:44:04,859 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:44:04,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-10-24 22:44:04,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ebe1538/934bcb2da6444d6da37a64156cca73f1/FLAG88695a29d [2020-10-24 22:44:05,660 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:44:05,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-10-24 22:44:05,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ebe1538/934bcb2da6444d6da37a64156cca73f1/FLAG88695a29d [2020-10-24 22:44:06,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ebe1538/934bcb2da6444d6da37a64156cca73f1 [2020-10-24 22:44:06,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:44:06,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:44:06,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:44:06,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:44:06,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:44:06,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45336ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06, skipping insertion in model container [2020-10-24 22:44:06,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:44:06,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:44:06,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:44:06,304 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:44:06,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:44:06,346 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:44:06,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06 WrapperNode [2020-10-24 22:44:06,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:44:06,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:44:06,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:44:06,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:44:06,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:44:06,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:44:06,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:44:06,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:44:06,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... [2020-10-24 22:44:06,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:44:06,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:44:06,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:44:06,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:44:06,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:44:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 22:44:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:44:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:44:06,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:44:11,142 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:44:11,143 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-24 22:44:11,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:44:11 BoogieIcfgContainer [2020-10-24 22:44:11,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:44:11,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:44:11,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:44:11,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:44:11,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:44:06" (1/3) ... [2020-10-24 22:44:11,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf76ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:44:11, skipping insertion in model container [2020-10-24 22:44:11,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:44:06" (2/3) ... [2020-10-24 22:44:11,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf76ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:44:11, skipping insertion in model container [2020-10-24 22:44:11,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:44:11" (3/3) ... [2020-10-24 22:44:11,167 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2020-10-24 22:44:11,182 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:44:11,188 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:44:11,204 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:44:11,235 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:44:11,236 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:44:11,236 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:44:11,236 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:44:11,237 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:44:11,237 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:44:11,237 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:44:11,237 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:44:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-10-24 22:44:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 22:44:11,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:44:11,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:44:11,263 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:44:11,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:44:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2020-10-24 22:44:11,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:44:11,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638466122] [2020-10-24 22:44:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 22:44:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:44:12,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 22:44:12,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:44:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:44:12,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:44:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:44:12,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638466122] [2020-10-24 22:44:12,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:44:12,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 22:44:12,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288004008] [2020-10-24 22:44:12,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 22:44:12,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:44:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 22:44:12,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 22:44:12,449 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-10-24 22:44:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:44:12,467 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-10-24 22:44:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 22:44:12,468 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-10-24 22:44:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:44:12,479 INFO L225 Difference]: With dead ends: 22 [2020-10-24 22:44:12,479 INFO L226 Difference]: Without dead ends: 8 [2020-10-24 22:44:12,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 22:44:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-10-24 22:44:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-10-24 22:44:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-24 22:44:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-10-24 22:44:12,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2020-10-24 22:44:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:44:12,530 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-10-24 22:44:12,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 22:44:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-10-24 22:44:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 22:44:12,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:44:12,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:44:12,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 22:44:12,745 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:44:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:44:12,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2020-10-24 22:44:12,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:44:12,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251795326] [2020-10-24 22:44:12,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 22:44:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:44:14,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 22:44:14,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:44:15,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 22:44:17,271 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2)))))) c_ULTIMATE.start_main_~S~0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))))) is different from false [2020-10-24 22:44:17,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-24 22:44:19,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-24 22:44:34,589 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.geq .cse2 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse2 .cse1)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse6) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse4) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7) (and .cse7 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse10)) (fp.geq ULTIMATE.start_main_~I~0 .cse10) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))))) is different from false [2020-10-24 22:44:45,441 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse3) (fp.geq v_prenex_1 .cse4) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse4) .cse3))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)))))) is different from false [2020-10-24 22:44:47,566 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse3) (fp.geq v_prenex_1 .cse4) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse4) .cse3))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)))))) is different from true [2020-10-24 22:44:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:44:47,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:44:49,871 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2020-10-24 22:44:52,060 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2020-10-24 22:44:54,273 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-10-24 22:44:56,473 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-10-24 22:44:56,513 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-24 22:44:56,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 22:44:56,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-24 22:44:58,643 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from false [2020-10-24 22:45:01,054 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from true [2020-10-24 22:45:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:45:01,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251795326] [2020-10-24 22:45:01,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:45:01,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-10-24 22:45:01,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932269207] [2020-10-24 22:45:01,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 22:45:01,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:45:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 22:45:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2020-10-24 22:45:01,060 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2020-10-24 22:45:03,215 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from false [2020-10-24 22:45:05,633 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from true [2020-10-24 22:45:07,786 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) .cse4)) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse4))))) is different from false [2020-10-24 22:45:09,979 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) .cse4)) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse4))))) is different from true [2020-10-24 22:45:12,120 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2020-10-24 22:45:14,298 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2020-10-24 22:45:16,442 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2)))))) c_ULTIMATE.start_main_~S~0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))))) is different from false [2020-10-24 22:45:18,587 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.geq .cse3 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse3 .cse2)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7) .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse6)))))) .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (fp.geq ULTIMATE.start_main_~I~0 .cse7) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0) (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse10)) (fp.geq ULTIMATE.start_main_~I~0 .cse10) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))))) is different from false [2020-10-24 22:45:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:45:18,615 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-10-24 22:45:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 22:45:18,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2020-10-24 22:45:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:45:18,617 INFO L225 Difference]: With dead ends: 12 [2020-10-24 22:45:18,617 INFO L226 Difference]: Without dead ends: 8 [2020-10-24 22:45:18,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2020-10-24 22:45:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-10-24 22:45:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-10-24 22:45:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-24 22:45:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2020-10-24 22:45:18,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2020-10-24 22:45:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:45:18,624 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2020-10-24 22:45:18,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 22:45:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-10-24 22:45:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 22:45:18,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:45:18,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:45:18,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 22:45:18,828 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:45:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:45:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2020-10-24 22:45:18,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:45:18,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196715743] [2020-10-24 22:45:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-24 22:45:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:45:25,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-24 22:45:25,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:45:25,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 22:45:28,106 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-10-24 22:45:28,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-24 22:45:32,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-24 22:45:45,765 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (not (fp.geq ULTIMATE.start_main_~I~0 .cse1)) (fp.geq .cse0 .cse2) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (not (fp.leq (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.geq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse8)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7))) is different from false [2020-10-24 22:45:56,770 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)))))) is different from false [2020-10-24 22:45:58,909 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)))))) is different from true [2020-10-24 22:45:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:45:58,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:46:01,146 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2020-10-24 22:46:03,321 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2020-10-24 22:46:05,485 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2020-10-24 22:46:07,646 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2020-10-24 22:46:07,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-24 22:46:07,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 22:46:07,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-24 22:46:09,773 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from false [2020-10-24 22:46:12,102 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from true [2020-10-24 22:46:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:46:12,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196715743] [2020-10-24 22:46:12,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:46:12,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-10-24 22:46:12,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065749740] [2020-10-24 22:46:12,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 22:46:12,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:46:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 22:46:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2020-10-24 22:46:12,106 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand 13 states. [2020-10-24 22:46:14,241 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from false [2020-10-24 22:46:16,568 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from true [2020-10-24 22:46:18,736 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse3))))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse1))))) is different from false [2020-10-24 22:46:20,910 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse3))))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse1))))) is different from true [2020-10-24 22:46:23,071 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2020-10-24 22:46:25,229 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2020-10-24 22:46:27,380 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) is different from false [2020-10-24 22:46:29,559 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (not (fp.geq ULTIMATE.start_main_~I~0 .cse2)) (fp.geq .cse1 .cse3) (fp.geq ULTIMATE.start_main_~I~0 .cse3) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse6 (let ((.cse7 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse6))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse5)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.geq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse8)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0)))) is different from false [2020-10-24 22:46:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:46:29,567 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-10-24 22:46:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 22:46:29,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2020-10-24 22:46:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:46:29,567 INFO L225 Difference]: With dead ends: 8 [2020-10-24 22:46:29,567 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 22:46:29,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2020-10-24 22:46:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 22:46:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 22:46:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 22:46:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 22:46:29,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-10-24 22:46:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:46:29,569 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 22:46:29,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 22:46:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 22:46:29,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 22:46:29,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 22:46:29,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 22:46:29,814 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-24 22:46:29,815 INFO L277 CegarLoopResult]: At program point L31(lines 20 32) the Hoare annotation is: true [2020-10-24 22:46:29,815 INFO L274 CegarLoopResult]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2020-10-24 22:46:29,815 INFO L274 CegarLoopResult]: For program point L13(lines 27 28) no Hoare annotation was computed. [2020-10-24 22:46:29,815 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-24 22:46:29,815 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-24 22:46:29,815 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-24 22:46:29,815 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-24 22:46:29,815 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-24 22:46:29,816 INFO L274 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-10-24 22:46:29,816 INFO L274 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-10-24 22:46:29,816 INFO L274 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-10-24 22:46:29,816 INFO L277 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: true [2020-10-24 22:46:29,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:46:29 BoogieIcfgContainer [2020-10-24 22:46:29,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:46:29,826 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:46:29,826 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:46:29,826 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:46:29,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:44:11" (3/4) ... [2020-10-24 22:46:29,830 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-24 22:46:29,842 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-10-24 22:46:29,842 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-10-24 22:46:29,843 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 22:46:29,843 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 22:46:29,908 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-24 22:46:29,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:46:29,911 INFO L168 Benchmark]: Toolchain (without parser) took 143896.98 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 31.5 MB in the end (delta: -7.8 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2020-10-24 22:46:29,913 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 35.7 MB. Free memory is still 18.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:46:29,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.86 ms. Allocated memory is still 46.1 MB. Free memory was 23.1 MB in the beginning and 24.2 MB in the end (delta: -1.1 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-24 22:46:29,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.52 ms. Allocated memory is still 46.1 MB. Free memory was 24.2 MB in the beginning and 22.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-24 22:46:29,918 INFO L168 Benchmark]: Boogie Preprocessor took 30.88 ms. Allocated memory is still 46.1 MB. Free memory was 22.7 MB in the beginning and 21.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:46:29,919 INFO L168 Benchmark]: RCFGBuilder took 4723.64 ms. Allocated memory is still 46.1 MB. Free memory was 21.4 MB in the beginning and 21.2 MB in the end (delta: 186.8 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 22:46:29,920 INFO L168 Benchmark]: TraceAbstraction took 138673.68 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 20.8 MB in the beginning and 34.0 MB in the end (delta: -13.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:46:29,922 INFO L168 Benchmark]: Witness Printer took 83.22 ms. Allocated memory is still 56.6 MB. Free memory was 33.6 MB in the beginning and 31.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:46:29,925 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 35.7 MB. Free memory is still 18.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 325.86 ms. Allocated memory is still 46.1 MB. Free memory was 23.1 MB in the beginning and 24.2 MB in the end (delta: -1.1 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.52 ms. Allocated memory is still 46.1 MB. Free memory was 24.2 MB in the beginning and 22.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.88 ms. Allocated memory is still 46.1 MB. Free memory was 22.7 MB in the beginning and 21.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4723.64 ms. Allocated memory is still 46.1 MB. Free memory was 21.4 MB in the beginning and 21.2 MB in the end (delta: 186.8 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 138673.68 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 20.8 MB in the beginning and 34.0 MB in the end (delta: -13.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 83.22 ms. Allocated memory is still 56.6 MB. Free memory was 33.6 MB in the beginning and 31.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 138.5s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 35.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 16 SDs, 0 SdLazy, 12 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 79.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 9.8s SatisfiabilityAnalysisTime, 92.7s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 10554 SizeOfPredicates, 15 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...