./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.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/inv_sqrt_Quake.c.v+cfa-reducer.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 18a7fa5d929aa4f94783ce4ac14d173e66069fd4 ............................................................................................................................................................................................................................................................................... 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/inv_sqrt_Quake.c.v+cfa-reducer.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 18a7fa5d929aa4f94783ce4ac14d173e66069fd4 .................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:26:21,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:26:21,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:26:21,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:26:21,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:26:21,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:26:21,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:26:21,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:26:21,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:26:21,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:26:21,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:26:21,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:26:21,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:26:21,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:26:21,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:26:21,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:26:21,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:26:21,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:26:21,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:26:21,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:26:21,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:26:21,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:26:21,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:26:21,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:26:21,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:26:21,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:26:21,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:26:21,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:26:22,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:26:22,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:26:22,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:26:22,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:26:22,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:26:22,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:26:22,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:26:22,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:26:22,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:26:22,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:26:22,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:26:22,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:26:22,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:26:22,016 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:26:22,092 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:26:22,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:26:22,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:26:22,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:26:22,097 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:26:22,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:26:22,097 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:26:22,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 22:26:22,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:26:22,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:26:22,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:26:22,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:26:22,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:26:22,101 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:26:22,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:26:22,101 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:26:22,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:26:22,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:26:22,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:26:22,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:26:22,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:26:22,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:26:22,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:26:22,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:26:22,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:26:22,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 22:26:22,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 22:26:22,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:26:22,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:26:22,105 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 -> 18a7fa5d929aa4f94783ce4ac14d173e66069fd4 [2020-10-24 22:26:22,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:26:22,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:26:22,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:26:22,597 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:26:22,598 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:26:22,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c [2020-10-24 22:26:22,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2a59ba8/20b3f888a75d4f59ac406c1ce8678ca4/FLAG3682fa8a6 [2020-10-24 22:26:23,479 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:26:23,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c [2020-10-24 22:26:23,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2a59ba8/20b3f888a75d4f59ac406c1ce8678ca4/FLAG3682fa8a6 [2020-10-24 22:26:23,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2a59ba8/20b3f888a75d4f59ac406c1ce8678ca4 [2020-10-24 22:26:23,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:26:23,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:26:23,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:26:23,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:26:23,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:26:23,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:26:23" (1/1) ... [2020-10-24 22:26:23,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2491717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:23, skipping insertion in model container [2020-10-24 22:26:23,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:26:23" (1/1) ... [2020-10-24 22:26:23,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:26:23,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:26:24,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:26:24,103 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:26:24,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:26:24,151 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:26:24,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24 WrapperNode [2020-10-24 22:26:24,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:26:24,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:26:24,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:26:24,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:26:24,172 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:26:24" (1/1) ... [2020-10-24 22:26:24,183 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:26:24" (1/1) ... [2020-10-24 22:26:24,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:26:24,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:26:24,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:26:24,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:26:24,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (1/1) ... [2020-10-24 22:26:24,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (1/1) ... [2020-10-24 22:26:24,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (1/1) ... [2020-10-24 22:26:24,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (1/1) ... [2020-10-24 22:26:24,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (1/1) ... [2020-10-24 22:26:24,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (1/1) ... [2020-10-24 22:26:24,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (1/1) ... [2020-10-24 22:26:24,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:26:24,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:26:24,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:26:24,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:26:24,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (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:26:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 22:26:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:26:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-10-24 22:26:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 22:26:24,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-24 22:26:24,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:26:24,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:26:24,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 22:26:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 22:26:24,769 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:26:24,770 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-24 22:26:24,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:24 BoogieIcfgContainer [2020-10-24 22:26:24,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:26:24,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:26:24,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:26:24,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:26:24,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:26:23" (1/3) ... [2020-10-24 22:26:24,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfde8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:26:24, skipping insertion in model container [2020-10-24 22:26:24,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:24" (2/3) ... [2020-10-24 22:26:24,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfde8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:26:24, skipping insertion in model container [2020-10-24 22:26:24,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:24" (3/3) ... [2020-10-24 22:26:24,786 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake.c.v+cfa-reducer.c [2020-10-24 22:26:24,802 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:26:24,809 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:26:24,829 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:26:24,860 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:26:24,861 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:26:24,861 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:26:24,862 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:26:24,862 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:26:24,862 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:26:24,862 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:26:24,863 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:26:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-10-24 22:26:24,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 22:26:24,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:26:24,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:26:24,888 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:26:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:26:24,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2135388399, now seen corresponding path program 1 times [2020-10-24 22:26:24,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 22:26:24,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96188671] [2020-10-24 22:26:24,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 22:26:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:26:25,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:26:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:26:25,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:26:25,166 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 22:26:25,168 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 22:26:25,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 22:26:25,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:26:25 BoogieIcfgContainer [2020-10-24 22:26:25,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:26:25,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:26:25,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:26:25,239 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:26:25,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:24" (3/4) ... [2020-10-24 22:26:25,245 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 22:26:25,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:26:25,252 INFO L168 Benchmark]: Toolchain (without parser) took 1445.11 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.9 MB in the beginning and 30.5 MB in the end (delta: -11.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:26:25,255 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 41.9 MB. Free memory was 25.0 MB in the beginning and 24.9 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:26:25,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.99 ms. Allocated memory is still 41.9 MB. Free memory was 27.6 MB in the beginning and 17.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-10-24 22:26:25,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.06 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.4 MB in the beginning and 34.1 MB in the end (delta: -16.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. [2020-10-24 22:26:25,260 INFO L168 Benchmark]: Boogie Preprocessor took 31.58 ms. Allocated memory is still 50.3 MB. Free memory was 34.1 MB in the beginning and 33.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:26:25,261 INFO L168 Benchmark]: RCFGBuilder took 531.92 ms. Allocated memory is still 50.3 MB. Free memory was 32.8 MB in the beginning and 30.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2020-10-24 22:26:25,263 INFO L168 Benchmark]: TraceAbstraction took 459.47 ms. Allocated memory is still 50.3 MB. Free memory was 30.0 MB in the beginning and 30.9 MB in the end (delta: -923.2 kB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. [2020-10-24 22:26:25,265 INFO L168 Benchmark]: Witness Printer took 8.65 ms. Allocated memory is still 50.3 MB. Free memory was 30.7 MB in the beginning and 30.5 MB in the end (delta: 234.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:26:25,283 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 41.9 MB. Free memory was 25.0 MB in the beginning and 24.9 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 317.99 ms. Allocated memory is still 41.9 MB. Free memory was 27.6 MB in the beginning and 17.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.06 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.4 MB in the beginning and 34.1 MB in the end (delta: -16.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.58 ms. Allocated memory is still 50.3 MB. Free memory was 34.1 MB in the beginning and 33.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 531.92 ms. Allocated memory is still 50.3 MB. Free memory was 32.8 MB in the beginning and 30.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 459.47 ms. Allocated memory is still 50.3 MB. Free memory was 30.0 MB in the beginning and 30.9 MB in the end (delta: -923.2 kB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. * Witness Printer took 8.65 ms. Allocated memory is still 50.3 MB. Free memory was 30.7 MB in the beginning and 30.5 MB in the end (delta: 234.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L17] float __return_72; [L18] int __return_87; VAL [__return_72=0, __return_87=0, __return_main=0] [L21] float main__a; [L22] float main__r; [L23] main__a = __VERIFIER_nondet_float() [L24] int main____CPAchecker_TMP_0; VAL [__return_72=0, __return_87=0, __return_main=0] [L25] COND TRUE main__a >= 0.10000000149011612 VAL [__return_72=0, __return_87=0, __return_main=0] [L27] COND TRUE main__a <= 100.0 [L29] main____CPAchecker_TMP_0 = 1 VAL [__return_72=0, __return_87=0, __return_main=0] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] float __tmp_1; [L34] __tmp_1 = main__a [L35] float InvSqrt__x; [L36] InvSqrt__x = __tmp_1 [L37] float InvSqrt__xhalf = 0.5 * InvSqrt__x; [L38] union float_int InvSqrt__i; [L39] InvSqrt__i.f = InvSqrt__x [L40] EXPR InvSqrt__i.i [L40] InvSqrt__i.i = 1597463007 - ((InvSqrt__i.i) >> 1) [L41] EXPR InvSqrt__i.f [L41] InvSqrt__x = InvSqrt__i.f [L42] InvSqrt__x = InvSqrt__x * (1.5 - ((InvSqrt__xhalf * InvSqrt__x) * InvSqrt__x)) [L43] __return_72 = InvSqrt__x [L44] main__r = __return_72 [L45] int main____CPAchecker_TMP_1; VAL [__return_72=50, __return_87=0, __return_main=0] [L46] COND FALSE !(main__r >= 0.0) VAL [__return_72=50, __return_87=0, __return_main=0] [L72] main____CPAchecker_TMP_1 = 0 VAL [__return_72=50, __return_87=0, __return_main=0] [L53] int __tmp_2; [L54] __tmp_2 = main____CPAchecker_TMP_1 [L55] int __VERIFIER_assert__cond; [L56] __VERIFIER_assert__cond = __tmp_2 VAL [__return_72=50, __return_87=0, __return_main=0] [L57] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_72=50, __return_87=0, __return_main=0] [L4] __assert_fail("0", "inv_sqrt_Quake.c.v+cfa-reducer.c", 4, "reach_error") VAL [__return_72=50, __return_87=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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:26:28,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:26:28,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:26:28,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:26:28,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:26:28,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:26:28,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:26:28,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:26:28,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:26:28,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:26:28,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:26:28,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:26:28,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:26:28,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:26:28,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:26:28,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:26:28,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:26:28,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:26:28,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:26:28,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:26:28,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:26:28,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:26:28,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:26:28,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:26:28,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:26:28,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:26:28,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:26:28,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:26:28,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:26:28,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:26:28,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:26:28,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:26:28,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:26:28,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:26:28,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:26:28,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:26:28,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:26:28,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:26:28,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:26:28,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:26:28,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:26:28,230 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:26:28,293 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:26:28,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:26:28,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:26:28,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:26:28,295 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:26:28,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:26:28,296 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:26:28,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:26:28,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:26:28,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:26:28,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:26:28,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:26:28,298 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 22:26:28,298 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 22:26:28,298 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:26:28,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:26:28,299 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:26:28,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:26:28,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:26:28,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:26:28,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:26:28,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:26:28,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:26:28,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:26:28,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:26:28,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:26:28,301 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 22:26:28,302 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 22:26:28,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:26:28,302 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:26:28,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 22:26:28,303 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 -> 18a7fa5d929aa4f94783ce4ac14d173e66069fd4 [2020-10-24 22:26:28,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:26:28,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:26:28,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:26:28,742 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:26:28,743 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:26:28,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c [2020-10-24 22:26:28,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7a6c970/c2299e60639946cfacb383764fb284f0/FLAGf1ed3034d [2020-10-24 22:26:29,601 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:26:29,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c [2020-10-24 22:26:29,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7a6c970/c2299e60639946cfacb383764fb284f0/FLAGf1ed3034d [2020-10-24 22:26:29,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7a6c970/c2299e60639946cfacb383764fb284f0 [2020-10-24 22:26:29,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:26:29,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:26:29,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:26:29,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:26:29,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:26:29,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:26:29" (1/1) ... [2020-10-24 22:26:29,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5238c1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:29, skipping insertion in model container [2020-10-24 22:26:29,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:26:29" (1/1) ... [2020-10-24 22:26:29,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:26:29,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:26:30,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:26:30,288 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:26:30,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:26:30,387 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:26:30,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30 WrapperNode [2020-10-24 22:26:30,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:26:30,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:26:30,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:26:30,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:26:30,403 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:26:30" (1/1) ... [2020-10-24 22:26:30,418 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:26:30" (1/1) ... [2020-10-24 22:26:30,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:26:30,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:26:30,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:26:30,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:26:30,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (1/1) ... [2020-10-24 22:26:30,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (1/1) ... [2020-10-24 22:26:30,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (1/1) ... [2020-10-24 22:26:30,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (1/1) ... [2020-10-24 22:26:30,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (1/1) ... [2020-10-24 22:26:30,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (1/1) ... [2020-10-24 22:26:30,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (1/1) ... [2020-10-24 22:26:30,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:26:30,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:26:30,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:26:30,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:26:30,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (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:26:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 22:26:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:26:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2020-10-24 22:26:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-24 22:26:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:26:30,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:26:30,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-10-24 22:26:30,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 22:26:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-10-24 22:26:33,865 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:26:33,866 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-24 22:26:33,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:33 BoogieIcfgContainer [2020-10-24 22:26:33,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:26:33,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:26:33,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:26:33,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:26:33,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:26:29" (1/3) ... [2020-10-24 22:26:33,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab0568f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:26:33, skipping insertion in model container [2020-10-24 22:26:33,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:30" (2/3) ... [2020-10-24 22:26:33,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab0568f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:26:33, skipping insertion in model container [2020-10-24 22:26:33,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:33" (3/3) ... [2020-10-24 22:26:33,880 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake.c.v+cfa-reducer.c [2020-10-24 22:26:33,894 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:26:33,900 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:26:33,914 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:26:33,945 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:26:33,946 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:26:33,946 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:26:33,946 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:26:33,947 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:26:33,947 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:26:33,947 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:26:33,947 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:26:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-10-24 22:26:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 22:26:33,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:26:33,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:26:33,971 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:26:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:26:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2135388399, now seen corresponding path program 1 times [2020-10-24 22:26:33,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:26:33,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074814087] [2020-10-24 22:26:33,995 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:26:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:26:36,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-24 22:26:36,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:26:36,959 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-10-24 22:26:37,727 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-10-24 22:26:39,900 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))))))) is different from false [2020-10-24 22:26:46,370 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)))))) is different from false [2020-10-24 22:26:48,503 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)))))) is different from true [2020-10-24 22:27:01,504 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:27:01,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:27:02,100 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2020-10-24 22:27:04,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) is different from false [2020-10-24 22:27:06,398 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) is different from true [2020-10-24 22:27:10,087 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))) is different from false [2020-10-24 22:27:12,294 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))) is different from true [2020-10-24 22:27:14,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (or (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) is different from false [2020-10-24 22:27:16,668 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (or (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) is different from true [2020-10-24 22:27:16,674 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:27:16,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074814087] [2020-10-24 22:27:16,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:27:16,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2020-10-24 22:27:16,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441923903] [2020-10-24 22:27:16,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 22:27:16,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:27:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 22:27:16,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=19, Unknown=9, NotChecked=60, Total=110 [2020-10-24 22:27:16,704 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 11 states. [2020-10-24 22:27:19,105 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (or (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-10-24 22:27:21,310 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (or (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:27:24,200 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (or (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from false [2020-10-24 22:27:26,396 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (or (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2020-10-24 22:34:54,213 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from false [2020-10-24 22:34:56,375 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2020-10-24 22:34:58,525 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))))))) is different from false [2020-10-24 22:36:15,011 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))))))) is different from true [2020-10-24 22:36:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:36:15,539 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-10-24 22:36:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 22:36:15,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2020-10-24 22:36:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:36:15,555 INFO L225 Difference]: With dead ends: 24 [2020-10-24 22:36:15,556 INFO L226 Difference]: Without dead ends: 12 [2020-10-24 22:36:15,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 560.8s TimeCoverageRelationStatistics Valid=30, Invalid=19, Unknown=17, NotChecked=144, Total=210 [2020-10-24 22:36:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-10-24 22:36:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-24 22:36:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-24 22:36:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-10-24 22:36:15,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-10-24 22:36:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:36:15,596 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-10-24 22:36:15,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 22:36:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-10-24 22:36:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 22:36:15,597 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:36:15,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:36:15,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 22:36:15,799 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:36:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:36:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2020-10-24 22:36:15,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:36:15,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431554616] [2020-10-24 22:36:15,808 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:36:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:36:16,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-24 22:36:16,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:36:16,408 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:36:16,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:36:16,434 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:36:16,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431554616] [2020-10-24 22:36:16,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:36:16,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 22:36:16,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799171205] [2020-10-24 22:36:16,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 22:36:16,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:36:16,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 22:36:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 22:36:16,445 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2020-10-24 22:36:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:36:19,025 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-10-24 22:36:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 22:36:19,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-24 22:36:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:36:19,027 INFO L225 Difference]: With dead ends: 16 [2020-10-24 22:36:19,027 INFO L226 Difference]: Without dead ends: 12 [2020-10-24 22:36:19,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-24 22:36:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-10-24 22:36:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-24 22:36:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-24 22:36:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2020-10-24 22:36:19,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 10 [2020-10-24 22:36:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:36:19,032 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2020-10-24 22:36:19,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 22:36:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-10-24 22:36:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 22:36:19,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:36:19,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:36:19,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 22:36:19,240 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:36:19,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:36:19,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1948390697, now seen corresponding path program 1 times [2020-10-24 22:36:19,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:36:19,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113419039] [2020-10-24 22:36:19,243 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:36:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:36:21,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 22:36:21,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:36:22,352 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-10-24 22:36:23,195 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-10-24 22:36:25,365 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2020-10-24 22:36:27,540 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2020-10-24 22:36:34,158 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2020-10-24 22:36:36,305 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))))))) is different from true [2020-10-24 22:36:49,322 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:36:49,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:36:50,046 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-24 22:36:51,070 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 22:36:53,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) .cse2) .cse2))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse0)) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2020-10-24 22:36:55,344 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) .cse2) .cse2))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse0)) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2020-10-24 22:36:58,264 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) .cse2) .cse2))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse0)) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from false [2020-10-24 22:37:00,475 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) .cse2) .cse2))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse0)) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from true [2020-10-24 22:37:02,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2020-10-24 22:37:04,798 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2020-10-24 22:37:04,802 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:37:04,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113419039] [2020-10-24 22:37:04,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:37:04,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-10-24 22:37:04,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76286232] [2020-10-24 22:37:04,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 22:37:04,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:37:04,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 22:37:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=10, NotChecked=90, Total=156 [2020-10-24 22:37:04,806 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand 13 states. [2020-10-24 22:37:07,153 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from false [2020-10-24 22:37:09,339 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from true [2020-10-24 22:37:11,558 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) .cse3) .cse3))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2020-10-24 22:37:46,242 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) .cse3) .cse3))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))))) is different from false [2020-10-24 22:37:48,440 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) .cse3) .cse3))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))))) is different from true [2020-10-24 22:37:50,597 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse2)) .cse1) .cse1))))))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2020-10-24 22:37:52,851 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse2)) .cse1) .cse1))))))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from false [2020-10-24 22:37:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:37:52,956 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-10-24 22:37:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 22:37:52,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-10-24 22:37:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:37:52,956 INFO L225 Difference]: With dead ends: 12 [2020-10-24 22:37:52,956 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 22:37:52,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 73.5s TimeCoverageRelationStatistics Valid=37, Invalid=32, Unknown=17, NotChecked=220, Total=306 [2020-10-24 22:37:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 22:37:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 22:37:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 22:37:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 22:37:52,958 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-10-24 22:37:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:37:52,958 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 22:37:52,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 22:37:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 22:37:52,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 22:37:53,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 22:37:53,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 22:37:53,224 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-24 22:37:53,224 INFO L274 CegarLoopResult]: For program point L27(lines 27 90) no Hoare annotation was computed. [2020-10-24 22:37:53,224 INFO L274 CegarLoopResult]: For program point L25(lines 25 95) no Hoare annotation was computed. [2020-10-24 22:37:53,225 INFO L274 CegarLoopResult]: For program point L48(lines 48 74) no Hoare annotation was computed. [2020-10-24 22:37:53,225 INFO L274 CegarLoopResult]: For program point L46(lines 46 79) no Hoare annotation was computed. [2020-10-24 22:37:53,225 INFO L270 CegarLoopResult]: At program point L73(lines 48 74) the Hoare annotation is: (= (_ bv1 32) ULTIMATE.start_main_~main____CPAchecker_TMP_1~0) [2020-10-24 22:37:53,225 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-24 22:37:53,225 INFO L274 CegarLoopResult]: For program point L30(lines 30 85) no Hoare annotation was computed. [2020-10-24 22:37:53,225 INFO L277 CegarLoopResult]: At program point L94(lines 19 96) the Hoare annotation is: true [2020-10-24 22:37:53,225 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-24 22:37:53,225 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-24 22:37:53,225 INFO L274 CegarLoopResult]: For program point L57(lines 57 66) no Hoare annotation was computed. [2020-10-24 22:37:53,226 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-24 22:37:53,226 INFO L270 CegarLoopResult]: At program point L78(lines 46 79) the Hoare annotation is: false [2020-10-24 22:37:53,226 INFO L274 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-10-24 22:37:53,226 INFO L274 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-10-24 22:37:53,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:37:53 BoogieIcfgContainer [2020-10-24 22:37:53,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:37:53,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:37:53,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:37:53,242 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:37:53,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:33" (3/4) ... [2020-10-24 22:37:53,245 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-24 22:37:53,258 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-10-24 22:37:53,259 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-10-24 22:37:53,259 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 22:37:53,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 22:37:53,315 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-24 22:37:53,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:37:53,318 INFO L168 Benchmark]: Toolchain (without parser) took 683395.83 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 27.1 MB in the beginning and 35.4 MB in the end (delta: -8.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:37:53,319 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 35.7 MB. Free memory was 18.6 MB in the beginning and 18.6 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:37:53,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.08 ms. Allocated memory is still 44.0 MB. Free memory was 26.6 MB in the beginning and 25.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2020-10-24 22:37:53,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.01 ms. Allocated memory is still 44.0 MB. Free memory was 25.4 MB in the beginning and 23.9 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:37:53,321 INFO L168 Benchmark]: Boogie Preprocessor took 41.54 ms. Allocated memory is still 44.0 MB. Free memory was 23.8 MB in the beginning and 22.5 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:37:53,322 INFO L168 Benchmark]: RCFGBuilder took 3379.76 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 22.5 MB in the beginning and 39.9 MB in the end (delta: -17.4 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-10-24 22:37:53,323 INFO L168 Benchmark]: TraceAbstraction took 679370.65 ms. Allocated memory is still 56.6 MB. Free memory was 39.4 MB in the beginning and 38.7 MB in the end (delta: 643.9 kB). Peak memory consumption was 24.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:37:53,323 INFO L168 Benchmark]: Witness Printer took 74.54 ms. Allocated memory is still 56.6 MB. Free memory was 38.3 MB in the beginning and 35.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-24 22:37:53,328 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.30 ms. Allocated memory is still 35.7 MB. Free memory was 18.6 MB in the beginning and 18.6 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 460.08 ms. Allocated memory is still 44.0 MB. Free memory was 26.6 MB in the beginning and 25.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.01 ms. Allocated memory is still 44.0 MB. Free memory was 25.4 MB in the beginning and 23.9 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.54 ms. Allocated memory is still 44.0 MB. Free memory was 23.8 MB in the beginning and 22.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3379.76 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 22.5 MB in the beginning and 39.9 MB in the end (delta: -17.4 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 679370.65 ms. Allocated memory is still 56.6 MB. Free memory was 39.4 MB in the beginning and 38.7 MB in the end (delta: 643.9 kB). Peak memory consumption was 24.1 MB. Max. memory is 16.1 GB. * Witness Printer took 74.54 ms. Allocated memory is still 56.6 MB. Free memory was 38.3 MB in the beginning and 35.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1bv32 == main____CPAchecker_TMP_1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 679.2s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 589.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 SDtfs, 2 SDslu, 53 SDs, 0 SdLazy, 21 SolverSat, 0 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 634.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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, 3 LocationsWithAnnotation, 3 PreInvPairs, 5 NumberOfFragments, 5 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 83.3s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 56 ConstructedInterpolants, 19 QuantifiedInterpolants, 33132 SizeOfPredicates, 21 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 27 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...