./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF --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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:28:33,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:28:33,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:28:33,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:28:33,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:28:33,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:28:33,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:28:33,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:28:33,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:28:33,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:28:33,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:28:33,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:28:33,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:28:33,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:28:33,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:28:33,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:28:33,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:28:33,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:28:33,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:28:33,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:28:33,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:28:33,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:28:33,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:28:33,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:28:33,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:28:33,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:28:33,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:28:33,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:28:33,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:28:33,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:28:33,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:28:33,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:28:33,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:28:33,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:28:33,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:28:33,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:28:33,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:28:33,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:28:33,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:28:33,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:28:33,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:28:33,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:28:33,281 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:28:33,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:28:33,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:28:33,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:28:33,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:28:33,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:28:33,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:28:33,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:28:33,285 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:28:33,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:28:33,285 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:28:33,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:28:33,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:28:33,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:28:33,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:28:33,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:28:33,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:28:33,287 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:28:33,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:28:33,288 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:28:33,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:28:33,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:28:33,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:28:33,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:28:33,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:28:33,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:28:33,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:28:33,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:28:33,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:28:33,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:28:33,291 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:28:33,291 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:28:33,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:28:33,291 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:28:33,292 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-11-20 07:28:33,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:28:33,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:28:33,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:28:33,738 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:28:33,739 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:28:33,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-20 07:28:33,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data/cf99bda4a/e0e83b6d97754d869485f5c581ffaef5/FLAG64bd67227 [2021-11-20 07:28:34,509 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:28:34,510 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-20 07:28:34,524 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data/cf99bda4a/e0e83b6d97754d869485f5c581ffaef5/FLAG64bd67227 [2021-11-20 07:28:34,852 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data/cf99bda4a/e0e83b6d97754d869485f5c581ffaef5 [2021-11-20 07:28:34,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:28:34,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:28:34,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:28:34,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:28:34,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:28:34,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:28:34" (1/1) ... [2021-11-20 07:28:34,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9763d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:34, skipping insertion in model container [2021-11-20 07:28:34,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:28:34" (1/1) ... [2021-11-20 07:28:34,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:28:34,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:28:35,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-20 07:28:35,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:28:35,167 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:28:35,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-20 07:28:35,187 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:28:35,203 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:28:35,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35 WrapperNode [2021-11-20 07:28:35,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:28:35,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:28:35,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:28:35,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:28:35,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,244 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2021-11-20 07:28:35,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:28:35,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:28:35,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:28:35,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:28:35,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:28:35,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:28:35,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:28:35,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:28:35,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (1/1) ... [2021-11-20 07:28:35,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:28:35,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:28:35,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:28:35,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:28:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:28:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:28:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:28:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:28:35,479 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:28:35,481 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:28:35,644 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:28:35,651 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:28:35,651 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 07:28:35,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:35 BoogieIcfgContainer [2021-11-20 07:28:35,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:28:35,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:28:35,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:28:35,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:28:35,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:28:34" (1/3) ... [2021-11-20 07:28:35,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf316b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:28:35, skipping insertion in model container [2021-11-20 07:28:35,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:35" (2/3) ... [2021-11-20 07:28:35,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf316b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:28:35, skipping insertion in model container [2021-11-20 07:28:35,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:35" (3/3) ... [2021-11-20 07:28:35,670 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-11-20 07:28:35,677 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:28:35,677 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 07:28:35,752 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:28:35,768 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:28:35,768 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 07:28:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:28:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 07:28:35,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:28:35,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:28:35,807 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:28:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:28:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2021-11-20 07:28:35,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:28:35,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72885749] [2021-11-20 07:28:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:28:35,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:28:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:28:36,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:28:36,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72885749] [2021-11-20 07:28:36,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72885749] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:28:36,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:28:36,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:28:36,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092455889] [2021-11-20 07:28:36,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:28:36,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 07:28:36,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:28:36,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 07:28:36,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 07:28:36,082 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:28:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:28:36,102 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-11-20 07:28:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 07:28:36,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-20 07:28:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:28:36,115 INFO L225 Difference]: With dead ends: 23 [2021-11-20 07:28:36,115 INFO L226 Difference]: Without dead ends: 9 [2021-11-20 07:28:36,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 07:28:36,126 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:28:36,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:28:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-20 07:28:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-20 07:28:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:28:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-11-20 07:28:36,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2021-11-20 07:28:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:28:36,171 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-11-20 07:28:36,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:28:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-11-20 07:28:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 07:28:36,173 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:28:36,173 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:28:36,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:28:36,175 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:28:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:28:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2021-11-20 07:28:36,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:28:36,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799799950] [2021-11-20 07:28:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:28:36,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:28:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:28:36,223 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 07:28:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:28:36,292 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 07:28:36,293 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 07:28:36,296 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 07:28:36,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:28:36,304 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-20 07:28:36,309 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:28:36,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:28:36 BoogieIcfgContainer [2021-11-20 07:28:36,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:28:36,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:28:36,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:28:36,351 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:28:36,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:35" (3/4) ... [2021-11-20 07:28:36,356 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-20 07:28:36,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:28:36,359 INFO L158 Benchmark]: Toolchain (without parser) took 1500.83ms. Allocated memory is still 134.2MB. Free memory was 96.2MB in the beginning and 72.7MB in the end (delta: 23.5MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2021-11-20 07:28:36,359 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:28:36,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.96ms. Allocated memory is still 134.2MB. Free memory was 95.9MB in the beginning and 108.2MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 07:28:36,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.01ms. Allocated memory is still 134.2MB. Free memory was 108.2MB in the beginning and 106.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:28:36,367 INFO L158 Benchmark]: Boogie Preprocessor took 42.50ms. Allocated memory is still 134.2MB. Free memory was 106.3MB in the beginning and 105.4MB in the end (delta: 823.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:28:36,370 INFO L158 Benchmark]: RCFGBuilder took 368.35ms. Allocated memory is still 134.2MB. Free memory was 105.4MB in the beginning and 96.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 07:28:36,371 INFO L158 Benchmark]: TraceAbstraction took 689.42ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 73.3MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-20 07:28:36,372 INFO L158 Benchmark]: Witness Printer took 7.07ms. Allocated memory is still 134.2MB. Free memory was 73.3MB in the beginning and 72.7MB in the end (delta: 611.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:28:36,382 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.33ms. Allocated memory is still 134.2MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.96ms. Allocated memory is still 134.2MB. Free memory was 95.9MB in the beginning and 108.2MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.01ms. Allocated memory is still 134.2MB. Free memory was 108.2MB in the beginning and 106.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.50ms. Allocated memory is still 134.2MB. Free memory was 106.3MB in the beginning and 105.4MB in the end (delta: 823.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.35ms. Allocated memory is still 134.2MB. Free memory was 105.4MB in the beginning and 96.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 689.42ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 73.3MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 7.07ms. Allocated memory is still 134.2MB. Free memory was 73.3MB in the beginning and 72.7MB in the end (delta: 611.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L25] CALL assume_abort_if_not(I >= 1. && I <= 3.) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, sqrt2=11863283/8388608] [L25] RET assume_abort_if_not(I >= 1. && I <= 3.) [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L30] CALL __VERIFIER_assert(S >= 1. && S <= 2.) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] [L16] reach_error() VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 13 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-20 07:28:36,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF --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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:28:39,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:28:39,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:28:39,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:28:39,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:28:39,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:28:39,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:28:39,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:28:39,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:28:39,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:28:39,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:28:39,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:28:39,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:28:39,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:28:39,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:28:39,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:28:39,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:28:39,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:28:39,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:28:39,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:28:39,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:28:39,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:28:39,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:28:39,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:28:39,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:28:39,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:28:39,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:28:39,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:28:39,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:28:39,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:28:39,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:28:39,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:28:39,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:28:39,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:28:39,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:28:39,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:28:39,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:28:39,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:28:39,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:28:39,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:28:39,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:28:39,322 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-20 07:28:39,356 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:28:39,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:28:39,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:28:39,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:28:39,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:28:39,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:28:39,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:28:39,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:28:39,359 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:28:39,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:28:39,359 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:28:39,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:28:39,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:28:39,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:28:39,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:28:39,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:28:39,361 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 07:28:39,361 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 07:28:39,361 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 07:28:39,361 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:28:39,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:28:39,362 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:28:39,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:28:39,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:28:39,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:28:39,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:28:39,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:28:39,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:28:39,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:28:39,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:28:39,364 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-20 07:28:39,364 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 07:28:39,364 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:28:39,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:28:39,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:28:39,365 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:28:39,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 07:28:39,376 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-11-20 07:28:39,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:28:39,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:28:39,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:28:39,880 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:28:39,881 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:28:39,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-20 07:28:39,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data/46eb2e169/a558b5d3c91448b4a40defbab57d1482/FLAG89bc61c63 [2021-11-20 07:28:40,516 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:28:40,516 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-20 07:28:40,531 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data/46eb2e169/a558b5d3c91448b4a40defbab57d1482/FLAG89bc61c63 [2021-11-20 07:28:40,908 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/data/46eb2e169/a558b5d3c91448b4a40defbab57d1482 [2021-11-20 07:28:40,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:28:40,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:28:40,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:28:40,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:28:40,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:28:40,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:28:40" (1/1) ... [2021-11-20 07:28:40,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a9b513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:40, skipping insertion in model container [2021-11-20 07:28:40,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:28:40" (1/1) ... [2021-11-20 07:28:40,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:28:40,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:28:41,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-20 07:28:41,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:28:41,244 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:28:41,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-20 07:28:41,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:28:41,346 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:28:41,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41 WrapperNode [2021-11-20 07:28:41,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:28:41,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:28:41,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:28:41,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:28:41,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,415 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2021-11-20 07:28:41,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:28:41,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:28:41,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:28:41,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:28:41,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:28:41,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:28:41,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:28:41,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:28:41,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (1/1) ... [2021-11-20 07:28:41,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:28:41,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:28:41,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:28:41,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:28:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:28:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 07:28:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:28:41,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:28:41,666 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:28:41,668 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:28:46,108 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:28:46,115 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:28:46,116 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 07:28:46,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:46 BoogieIcfgContainer [2021-11-20 07:28:46,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:28:46,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:28:46,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:28:46,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:28:46,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:28:40" (1/3) ... [2021-11-20 07:28:46,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce9f4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:28:46, skipping insertion in model container [2021-11-20 07:28:46,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:41" (2/3) ... [2021-11-20 07:28:46,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce9f4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:28:46, skipping insertion in model container [2021-11-20 07:28:46,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:46" (3/3) ... [2021-11-20 07:28:46,127 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-11-20 07:28:46,134 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:28:46,134 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 07:28:46,219 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:28:46,240 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:28:46,240 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 07:28:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:28:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 07:28:46,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:28:46,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:28:46,295 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:28:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:28:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2021-11-20 07:28:46,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:28:46,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244271206] [2021-11-20 07:28:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:28:46,318 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:28:46,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:28:46,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:28:46,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 07:28:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:47,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-20 07:28:47,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:28:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:28:47,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:28:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:28:47,443 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:28:47,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244271206] [2021-11-20 07:28:47,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244271206] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:28:47,445 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:28:47,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-20 07:28:47,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498967132] [2021-11-20 07:28:47,448 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:28:47,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 07:28:47,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:28:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 07:28:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 07:28:47,493 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:28:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:28:47,510 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-11-20 07:28:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 07:28:47,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-20 07:28:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:28:47,522 INFO L225 Difference]: With dead ends: 23 [2021-11-20 07:28:47,522 INFO L226 Difference]: Without dead ends: 9 [2021-11-20 07:28:47,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 07:28:47,531 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:28:47,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:28:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-20 07:28:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-20 07:28:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:28:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-11-20 07:28:47,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2021-11-20 07:28:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:28:47,570 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-11-20 07:28:47,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:28:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-11-20 07:28:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 07:28:47,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:28:47,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:28:47,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:28:47,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:28:47,786 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:28:47,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:28:47,788 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2021-11-20 07:28:47,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:28:47,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624797030] [2021-11-20 07:28:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:28:47,789 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:28:47,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:28:47,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:28:47,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 07:28:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:49,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 07:28:49,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:29:07,423 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1))))))) |c_ULTIMATE.start_main_~S~0#1|) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:29:09,506 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1))))))) |c_ULTIMATE.start_main_~S~0#1|) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:30:56,903 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))))))) is different from false [2021-11-20 07:30:58,981 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))))))) is different from true [2021-11-20 07:31:51,399 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))))))) is different from false [2021-11-20 07:31:53,479 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))))))) is different from true [2021-11-20 07:31:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:31:53,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:32:09,694 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from false [2021-11-20 07:32:11,837 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from true [2021-11-20 07:32:45,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from false [2021-11-20 07:32:47,364 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from true [2021-11-20 07:33:42,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) is different from false [2021-11-20 07:33:44,307 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) is different from true [2021-11-20 07:33:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:33:44,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:33:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624797030] [2021-11-20 07:33:44,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624797030] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:33:44,309 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:33:44,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-20 07:33:44,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911936106] [2021-11-20 07:33:44,309 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:33:44,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 07:33:44,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:33:44,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 07:33:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=29, Unknown=12, NotChecked=90, Total=156 [2021-11-20 07:33:44,314 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:33:46,427 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:33:48,561 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:33:50,681 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse3)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-20 07:33:52,816 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse3)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:33:54,938 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2021-11-20 07:33:57,073 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2021-11-20 07:33:59,196 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1))))))) |c_ULTIMATE.start_main_~S~0#1|) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:34:01,322 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1))))))))))) is different from false [2021-11-20 07:34:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:01,343 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2021-11-20 07:34:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:34:01,344 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-20 07:34:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:01,345 INFO L225 Difference]: With dead ends: 13 [2021-11-20 07:34:01,345 INFO L226 Difference]: Without dead ends: 9 [2021-11-20 07:34:01,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=35, Invalid=31, Unknown=20, NotChecked=220, Total=306 [2021-11-20 07:34:01,348 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:01,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2021-11-20 07:34:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-20 07:34:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-20 07:34:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:34:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2021-11-20 07:34:01,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 8 [2021-11-20 07:34:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:01,353 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2021-11-20 07:34:01,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:34:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2021-11-20 07:34:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 07:34:01,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:01,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:01,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-20 07:34:01,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:34:01,569 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:34:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 176701705, now seen corresponding path program 1 times [2021-11-20 07:34:01,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:34:01,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205087168] [2021-11-20 07:34:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:01,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:34:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:34:01,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:34:01,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 07:34:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:37,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 07:34:37,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:53,641 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) |c_ULTIMATE.start_main_~S~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:36:41,849 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4))))) is different from false [2021-11-20 07:36:43,935 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4))))) is different from true [2021-11-20 07:37:36,900 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse0)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2))))) is different from false [2021-11-20 07:37:38,987 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse0)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2))))) is different from true [2021-11-20 07:37:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:37:38,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:37:54,800 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from false [2021-11-20 07:37:56,936 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from true [2021-11-20 07:38:30,371 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from false [2021-11-20 07:38:32,516 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from true [2021-11-20 07:39:26,558 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) is different from false [2021-11-20 07:39:28,698 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) is different from true [2021-11-20 07:39:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:39:28,699 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:39:28,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205087168] [2021-11-20 07:39:28,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205087168] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:39:28,700 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:39:28,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-20 07:39:28,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224527194] [2021-11-20 07:39:28,701 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:39:28,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 07:39:28,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:39:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 07:39:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-11-20 07:39:28,703 INFO L87 Difference]: Start difference. First operand 9 states and 8 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:39:30,822 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:39:32,959 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:39:35,107 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) .cse4 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-20 07:39:37,245 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) .cse4 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:39:39,395 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2021-11-20 07:39:41,527 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2021-11-20 07:39:43,676 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) |c_ULTIMATE.start_main_~S~0#1|)))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:39:45,826 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4)))))) is different from false [2021-11-20 07:39:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:39:45,836 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2021-11-20 07:39:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:39:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-20 07:39:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:39:45,837 INFO L225 Difference]: With dead ends: 9 [2021-11-20 07:39:45,837 INFO L226 Difference]: Without dead ends: 0 [2021-11-20 07:39:45,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-11-20 07:39:45,840 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:39:45,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2021-11-20 07:39:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-20 07:39:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-20 07:39:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:39:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 07:39:45,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2021-11-20 07:39:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:39:45,843 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 07:39:45,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:39:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-20 07:39:45,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-20 07:39:45,847 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 07:39:45,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-20 07:39:46,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:39:46,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-20 07:39:46,066 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-20 07:39:46,066 INFO L861 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-11-20 07:39:46,067 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 28) no Hoare annotation was computed. [2021-11-20 07:39:46,067 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 28) no Hoare annotation was computed. [2021-11-20 07:39:46,067 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2021-11-20 07:39:46,067 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-20 07:39:46,068 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-20 07:39:46,068 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-20 07:39:46,068 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-11-20 07:39:46,069 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-11-20 07:39:46,069 INFO L858 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-11-20 07:39:46,069 INFO L858 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-11-20 07:39:46,069 INFO L861 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-11-20 07:39:46,074 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-20 07:39:46,075 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:39:46,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:39:46 BoogieIcfgContainer [2021-11-20 07:39:46,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:39:46,085 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:39:46,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:39:46,086 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:39:46,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:46" (3/4) ... [2021-11-20 07:39:46,090 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 07:39:46,102 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2021-11-20 07:39:46,103 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-20 07:39:46,103 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-20 07:39:46,103 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 07:39:46,141 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:39:46,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:39:46,142 INFO L158 Benchmark]: Toolchain (without parser) took 665223.63ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 32.6MB in the beginning and 40.2MB in the end (delta: -7.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2021-11-20 07:39:46,143 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 54.5MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:39:46,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.73ms. Allocated memory is still 54.5MB. Free memory was 32.5MB in the beginning and 37.0MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-20 07:39:46,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.13ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 35.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:39:46,144 INFO L158 Benchmark]: Boogie Preprocessor took 41.91ms. Allocated memory is still 54.5MB. Free memory was 35.3MB in the beginning and 34.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:39:46,145 INFO L158 Benchmark]: RCFGBuilder took 4658.31ms. Allocated memory is still 54.5MB. Free memory was 34.1MB in the beginning and 25.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 07:39:46,145 INFO L158 Benchmark]: TraceAbstraction took 659964.53ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 25.3MB in the beginning and 42.9MB in the end (delta: -17.5MB). Peak memory consumption was 114.2kB. Max. memory is 16.1GB. [2021-11-20 07:39:46,146 INFO L158 Benchmark]: Witness Printer took 55.76ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 40.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-20 07:39:46,149 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.41ms. Allocated memory is still 54.5MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.73ms. Allocated memory is still 54.5MB. Free memory was 32.5MB in the beginning and 37.0MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.13ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 35.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.91ms. Allocated memory is still 54.5MB. Free memory was 35.3MB in the beginning and 34.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 4658.31ms. Allocated memory is still 54.5MB. Free memory was 34.1MB in the beginning and 25.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 659964.53ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 25.3MB in the beginning and 42.9MB in the end (delta: -17.5MB). Peak memory consumption was 114.2kB. Max. memory is 16.1GB. * Witness Printer took 55.76ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 40.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 659.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 33 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 84.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 38.1s SatisfiabilityAnalysisTime, 586.6s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 8 QuantifiedInterpolants, 1799 SizeOfPredicates, 15 NumberOfNonLiveVariables, 78 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-20 07:39:46,389 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-20 07:39:46,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3689f224-1b3a-4b0f-91f6-959423e4427d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE