./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:48:02,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:48:02,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:48:02,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:48:02,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:48:02,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:48:02,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:48:02,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:48:02,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:48:02,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:48:02,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:48:02,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:48:02,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:48:02,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:48:02,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:48:02,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:48:02,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:48:02,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:48:02,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:48:02,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:48:02,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:48:02,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:48:02,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:48:02,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:48:02,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:48:02,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:48:02,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:48:02,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:48:02,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:48:02,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:48:02,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:48:02,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:48:02,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:48:02,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:48:02,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:48:02,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:48:02,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:48:02,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:48:02,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:48:02,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:48:02,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:48:02,175 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:48:02,216 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:48:02,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:48:02,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:48:02,217 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:48:02,218 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:48:02,218 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:48:02,218 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:48:02,219 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:48:02,219 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:48:02,219 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:48:02,219 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:48:02,220 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:48:02,220 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:48:02,220 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:48:02,221 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:48:02,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:48:02,222 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:48:02,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:48:02,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:48:02,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:48:02,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:48:02,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:48:02,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:48:02,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:48:02,224 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:48:02,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:48:02,224 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:48:02,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:48:02,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:48:02,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:48:02,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:48:02,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:48:02,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:48:02,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:48:02,227 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:48:02,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:48:02,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:48:02,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:48:02,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:48:02,228 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/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_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8 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 -> Taipan 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 -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc [2021-11-07 01:48:02,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:48:02,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:48:02,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:48:02,507 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:48:02,508 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:48:02,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-07 01:48:02,583 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data/8e5f51a5f/1b22ace6f42540bd9d120e85d8e3bcc9/FLAGf98ec9e92 [2021-11-07 01:48:03,008 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:48:03,009 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-07 01:48:03,015 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data/8e5f51a5f/1b22ace6f42540bd9d120e85d8e3bcc9/FLAGf98ec9e92 [2021-11-07 01:48:03,409 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data/8e5f51a5f/1b22ace6f42540bd9d120e85d8e3bcc9 [2021-11-07 01:48:03,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:48:03,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:48:03,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:48:03,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:48:03,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:48:03,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6590cc56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03, skipping insertion in model container [2021-11-07 01:48:03,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:48:03,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:48:03,624 WARN L228 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_296832f4-f719-4bb4-b8d7-6c81dc67890a/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-07 01:48:03,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:48:03,682 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:48:03,694 WARN L228 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_296832f4-f719-4bb4-b8d7-6c81dc67890a/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-07 01:48:03,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:48:03,714 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:48:03,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03 WrapperNode [2021-11-07 01:48:03,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:48:03,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:48:03,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:48:03,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:48:03,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:48:03,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:48:03,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:48:03,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:48:03,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:48:03,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:48:03,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:48:03,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:48:03,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (1/1) ... [2021-11-07 01:48:03,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:48:03,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:48:03,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:48:03,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:48:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:48:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:48:03,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:48:03,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:48:04,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:48:04,155 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-07 01:48:04,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:04 BoogieIcfgContainer [2021-11-07 01:48:04,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:48:04,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:48:04,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:48:04,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:48:04,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:48:03" (1/3) ... [2021-11-07 01:48:04,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40275ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:04, skipping insertion in model container [2021-11-07 01:48:04,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:03" (2/3) ... [2021-11-07 01:48:04,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40275ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:04, skipping insertion in model container [2021-11-07 01:48:04,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:04" (3/3) ... [2021-11-07 01:48:04,167 INFO L111 eAbstractionObserver]: Analyzing ICFG loop3.c [2021-11-07 01:48:04,172 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:48:04,173 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:48:04,220 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:48:04,232 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=FINITE_AUTOMATA, 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-07 01:48:04,232 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:48:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-07 01:48:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-07 01:48:04,267 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:04,268 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-07 01:48:04,268 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:48:04,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 80052486, now seen corresponding path program 1 times [2021-11-07 01:48:04,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:04,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524374615] [2021-11-07 01:48:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:04,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:04,499 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-07 01:48:04,500 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:04,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524374615] [2021-11-07 01:48:04,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524374615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:04,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:04,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:48:04,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757939050] [2021-11-07 01:48:04,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 01:48:04,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:04,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 01:48:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 01:48:04,534 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-07 01:48:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:04,549 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-11-07 01:48:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 01:48:04,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2021-11-07 01:48:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:04,561 INFO L225 Difference]: With dead ends: 15 [2021-11-07 01:48:04,561 INFO L226 Difference]: Without dead ends: 7 [2021-11-07 01:48:04,565 INFO L786 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-07 01:48:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-11-07 01:48:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-11-07 01:48:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-07 01:48:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-11-07 01:48:04,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-11-07 01:48:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:04,596 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-11-07 01:48:04,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-07 01:48:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-11-07 01:48:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 01:48:04,597 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:04,598 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 01:48:04,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:48:04,598 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:48:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1807980756, now seen corresponding path program 1 times [2021-11-07 01:48:04,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:04,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855700327] [2021-11-07 01:48:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:04,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:48:04,663 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:48:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:48:04,717 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:48:04,718 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:48:04,720 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:04,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:48:04,725 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-07 01:48:04,728 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:48:04,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:48:04 BoogieIcfgContainer [2021-11-07 01:48:04,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:48:04,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:48:04,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:48:04,757 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:48:04,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:04" (3/4) ... [2021-11-07 01:48:04,761 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 01:48:04,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:48:04,764 INFO L168 Benchmark]: Toolchain (without parser) took 1337.79 ms. Allocated memory is still 107.0 MB. Free memory was 66.4 MB in the beginning and 43.2 MB in the end (delta: 23.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:04,765 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 107.0 MB. Free memory is still 82.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:48:04,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.81 ms. Allocated memory is still 107.0 MB. Free memory was 66.1 MB in the beginning and 82.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:04,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.96 ms. Allocated memory is still 107.0 MB. Free memory was 82.3 MB in the beginning and 81.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:04,774 INFO L168 Benchmark]: Boogie Preprocessor took 23.15 ms. Allocated memory is still 107.0 MB. Free memory was 81.0 MB in the beginning and 79.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:04,775 INFO L168 Benchmark]: RCFGBuilder took 382.15 ms. Allocated memory is still 107.0 MB. Free memory was 79.7 MB in the beginning and 67.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:04,777 INFO L168 Benchmark]: TraceAbstraction took 595.55 ms. Allocated memory is still 107.0 MB. Free memory was 66.7 MB in the beginning and 43.6 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:04,777 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 107.0 MB. Free memory is still 43.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:48:04,786 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.29 ms. Allocated memory is still 107.0 MB. Free memory is still 82.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 287.81 ms. Allocated memory is still 107.0 MB. Free memory was 66.1 MB in the beginning and 82.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.96 ms. Allocated memory is still 107.0 MB. Free memory was 82.3 MB in the beginning and 81.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.15 ms. Allocated memory is still 107.0 MB. Free memory was 81.0 MB in the beginning and 79.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 382.15 ms. Allocated memory is still 107.0 MB. Free memory was 79.7 MB in the beginning and 67.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 595.55 ms. Allocated memory is still 107.0 MB. Free memory was 66.7 MB in the beginning and 43.6 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.35 ms. Allocated memory is still 107.0 MB. Free memory is still 43.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of to_real at line 22, overapproximation of someBinaryArithmeticFLOAToperation at line 34. Possible FailurePath: [L15] float pi = 3.14159 ; [L21] float x = __VERIFIER_nondet_float() ; [L22] float octant1 = 0 ; [L23] float octant2 = pi/8 ; [L11] COND FALSE !(!cond) [L25] float oddExp = x ; [L26] float evenExp = 1.0 ; [L27] float term = x ; [L28] unsigned int count = 2 ; [L29] int multFactor = 0 ; [L30] int temp ; VAL [pi=314159/100000] [L32] COND TRUE 1 [L34] term = term * (x/count) [L35] EXPR (count>>1 % 2 == 0) ? 1 : -1 [L35] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L37] evenExp = evenExp + multFactor*term [L39] count++ [L41] term = term * (x/count) [L43] oddExp = oddExp + multFactor*term [L45] count++ [L47] temp = __VERIFIER_nondet_int() [L48] COND TRUE temp == 0 VAL [pi=314159/100000] [L13] COND TRUE !(cond) VAL [pi=314159/100000] [L13] reach_error() VAL [pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 4 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-07 01:48:04,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/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_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:48:07,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:48:07,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:48:07,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:48:07,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:48:07,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:48:07,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:48:07,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:48:07,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:48:07,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:48:07,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:48:07,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:48:07,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:48:07,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:48:07,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:48:07,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:48:07,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:48:07,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:48:07,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:48:07,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:48:07,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:48:07,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:48:07,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:48:07,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:48:07,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:48:07,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:48:07,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:48:07,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:48:07,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:48:07,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:48:07,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:48:07,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:48:07,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:48:07,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:48:07,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:48:07,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:48:07,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:48:07,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:48:07,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:48:07,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:48:07,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:48:07,429 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 01:48:07,480 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:48:07,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:48:07,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:48:07,482 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:48:07,482 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:48:07,482 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:48:07,482 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:48:07,482 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:48:07,483 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:48:07,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:48:07,486 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:48:07,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:48:07,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:48:07,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:48:07,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:48:07,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:48:07,487 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:48:07,487 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 01:48:07,487 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 01:48:07,487 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:48:07,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:48:07,488 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:48:07,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:48:07,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:48:07,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 01:48:07,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:48:07,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:48:07,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:48:07,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:48:07,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:48:07,490 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 01:48:07,490 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 01:48:07,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:48:07,490 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:48:07,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:48:07,491 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_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/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_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8 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 -> Taipan 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 -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc [2021-11-07 01:48:07,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:48:07,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:48:07,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:48:07,888 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:48:07,889 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:48:07,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-07 01:48:07,971 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data/7bc76753f/42d0215b1f42452b8103edd9e93f4764/FLAGcd527f3bb [2021-11-07 01:48:08,450 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:48:08,451 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-07 01:48:08,462 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data/7bc76753f/42d0215b1f42452b8103edd9e93f4764/FLAGcd527f3bb [2021-11-07 01:48:08,831 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/data/7bc76753f/42d0215b1f42452b8103edd9e93f4764 [2021-11-07 01:48:08,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:48:08,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:48:08,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:48:08,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:48:08,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:48:08,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:08" (1/1) ... [2021-11-07 01:48:08,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46047d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:08, skipping insertion in model container [2021-11-07 01:48:08,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:08" (1/1) ... [2021-11-07 01:48:08,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:48:08,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:48:09,053 WARN L228 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_296832f4-f719-4bb4-b8d7-6c81dc67890a/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-07 01:48:09,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:48:09,089 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:48:09,108 WARN L228 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_296832f4-f719-4bb4-b8d7-6c81dc67890a/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-07 01:48:09,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:48:09,152 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:48:09,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09 WrapperNode [2021-11-07 01:48:09,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:48:09,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:48:09,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:48:09,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:48:09,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:48:09,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:48:09,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:48:09,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:48:09,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:48:09,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:48:09,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:48:09,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:48:09,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (1/1) ... [2021-11-07 01:48:09,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:48:09,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:48:09,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:48:09,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:48:09,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 01:48:09,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:48:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:48:09,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:48:13,817 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:48:13,817 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-07 01:48:13,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:13 BoogieIcfgContainer [2021-11-07 01:48:13,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:48:13,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:48:13,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:48:13,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:48:13,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:48:08" (1/3) ... [2021-11-07 01:48:13,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17734f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:13, skipping insertion in model container [2021-11-07 01:48:13,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:09" (2/3) ... [2021-11-07 01:48:13,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17734f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:13, skipping insertion in model container [2021-11-07 01:48:13,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:13" (3/3) ... [2021-11-07 01:48:13,832 INFO L111 eAbstractionObserver]: Analyzing ICFG loop3.c [2021-11-07 01:48:13,838 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:48:13,838 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:48:13,892 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:48:13,899 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=FINITE_AUTOMATA, 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-07 01:48:13,900 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:48:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-07 01:48:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:48:13,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:13,920 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:13,920 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:48:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-11-07 01:48:13,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:48:13,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165038570] [2021-11-07 01:48:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:13,940 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:48:13,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:48:13,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:48:13,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 01:48:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:14,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-07 01:48:14,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:48:14,183 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-07 01:48:14,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:48:14,234 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-07 01:48:14,235 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:48:14,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165038570] [2021-11-07 01:48:14,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165038570] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:14,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:14,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 01:48:14,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093161014] [2021-11-07 01:48:14,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 01:48:14,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:48:14,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 01:48:14,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 01:48:14,267 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-07 01:48:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:14,282 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-11-07 01:48:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 01:48:14,284 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-07 01:48:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:14,293 INFO L225 Difference]: With dead ends: 29 [2021-11-07 01:48:14,293 INFO L226 Difference]: Without dead ends: 12 [2021-11-07 01:48:14,296 INFO L786 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-07 01:48:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-07 01:48:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-07 01:48:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-07 01:48:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-11-07 01:48:14,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-11-07 01:48:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:14,331 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-11-07 01:48:14,331 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-07 01:48:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-11-07 01:48:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:48:14,333 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:14,333 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:14,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:48:14,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:48:14,547 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:48:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-11-07 01:48:14,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:48:14,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666097779] [2021-11-07 01:48:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:14,555 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:48:14,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:48:14,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:48:14,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 01:48:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:15,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:48:15,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:48:15,455 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-07 01:48:15,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:48:15,548 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-07 01:48:15,548 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:48:15,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666097779] [2021-11-07 01:48:15,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666097779] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:15,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:15,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 01:48:15,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498410350] [2021-11-07 01:48:15,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:48:15,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:48:15,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:48:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:48:15,553 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-07 01:48:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:20,332 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-11-07 01:48:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:48:20,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 11 [2021-11-07 01:48:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:20,334 INFO L225 Difference]: With dead ends: 24 [2021-11-07 01:48:20,334 INFO L226 Difference]: Without dead ends: 16 [2021-11-07 01:48:20,335 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:48:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-07 01:48:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-11-07 01:48:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-07 01:48:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-07 01:48:20,340 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-11-07 01:48:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:20,340 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-07 01:48:20,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-07 01:48:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-07 01:48:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:48:20,341 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:20,342 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:20,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:48:20,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:48:20,543 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:48:20,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-11-07 01:48:20,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:48:20,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369362421] [2021-11-07 01:48:20,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:20,544 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:48:20,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:48:20,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:48:20,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 01:48:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:23,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-07 01:48:23,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:48:54,837 WARN L207 SmtUtils]: Spent 13.38 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-07 01:49:37,939 WARN L207 SmtUtils]: Spent 17.53 s on a formula simplification that was a NOOP. DAG size: 34 [2021-11-07 01:49:55,777 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2021-11-07 01:49:57,850 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2021-11-07 01:51:10,976 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2021-11-07 01:51:13,044 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2021-11-07 01:51:30,350 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2021-11-07 01:51:32,425 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2021-11-07 01:51:32,425 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-07 01:51:32,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:51:40,822 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from false [2021-11-07 01:51:42,896 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from true [2021-11-07 01:51:49,110 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from false [2021-11-07 01:51:51,173 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from true [2021-11-07 01:51:57,527 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from false [2021-11-07 01:51:59,640 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from true [2021-11-07 01:52:05,976 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) is different from false [2021-11-07 01:52:08,075 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) is different from true [2021-11-07 01:52:18,890 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) is different from false [2021-11-07 01:52:36,662 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))))) is different from true [2021-11-07 01:52:36,662 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-07 01:52:36,662 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:52:36,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369362421] [2021-11-07 01:52:36,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369362421] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:52:36,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:52:36,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-07 01:52:36,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945896971] [2021-11-07 01:52:36,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 01:52:36,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:52:36,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 01:52:36,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=66, Unknown=18, NotChecked=216, Total=342 [2021-11-07 01:52:36,666 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-07 01:52:38,762 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from false [2021-11-07 01:52:40,871 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from true [2021-11-07 01:52:42,982 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (and (let ((.cse1 (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (.cse2 (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse1 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (or (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse3 .cse4)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) .cse0))) is different from false [2021-11-07 01:52:45,100 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (and (let ((.cse1 (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (.cse2 (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse1 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (or (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse3 .cse4)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) .cse0))) is different from true [2021-11-07 01:52:47,205 WARN L838 $PredicateComparison]: unable to prove that (and (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:52:49,321 WARN L860 $PredicateComparison]: unable to prove that (and (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 01:52:51,431 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~term~0 c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:52:53,557 WARN L860 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~term~0 c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 01:52:55,672 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:52:57,756 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 01:52:59,872 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:53:01,965 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 01:53:04,077 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~evenExp~0 c_ULTIMATE.start_main_~oddExp~0) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from false [2021-11-07 01:53:06,211 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2021-11-07 01:53:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:53:20,001 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-11-07 01:53:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 01:53:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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 11 [2021-11-07 01:53:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:53:20,007 INFO L225 Difference]: With dead ends: 20 [2021-11-07 01:53:20,007 INFO L226 Difference]: Without dead ends: 16 [2021-11-07 01:53:20,009 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 116.7s TimeCoverageRelationStatistics Valid=58, Invalid=68, Unknown=32, NotChecked=544, Total=702 [2021-11-07 01:53:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-07 01:53:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-07 01:53:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-07 01:53:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-11-07 01:53:20,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-11-07 01:53:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:53:20,013 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-11-07 01:53:20,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-07 01:53:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-11-07 01:53:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:53:20,014 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:53:20,014 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:53:20,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:53:20,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:53:20,236 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:53:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:53:20,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1599389039, now seen corresponding path program 1 times [2021-11-07 01:53:20,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:53:20,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655938946] [2021-11-07 01:53:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:53:20,238 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:53:20,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:53:20,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:53:20,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 01:53:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:53:21,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 01:53:21,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:53:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:53:21,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:53:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:53:22,181 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:53:22,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655938946] [2021-11-07 01:53:22,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655938946] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:53:22,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2125247486] [2021-11-07 01:53:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:53:22,182 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-07 01:53:22,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/cvc4 [2021-11-07 01:53:22,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-07 01:53:22,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-07 01:53:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:53:22,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 01:53:22,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:53:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:53:22,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:53:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:53:22,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2125247486] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:53:22,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465168940] [2021-11-07 01:53:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:53:22,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:53:22,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:53:22,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:53:22,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 01:53:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:53:24,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 01:53:24,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:53:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:53:24,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:53:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:53:24,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465168940] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:53:24,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-11-07 01:53:24,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2021-11-07 01:53:24,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572366267] [2021-11-07 01:53:24,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:53:24,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:53:24,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:53:24,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:53:24,325 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-07 01:53:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:53:33,771 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-07 01:53:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:53:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 15 [2021-11-07 01:53:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:53:33,773 INFO L225 Difference]: With dead ends: 35 [2021-11-07 01:53:33,773 INFO L226 Difference]: Without dead ends: 27 [2021-11-07 01:53:33,773 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:53:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-07 01:53:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-11-07 01:53:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-07 01:53:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-11-07 01:53:33,777 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-11-07 01:53:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:53:33,778 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-11-07 01:53:33,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-07 01:53:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-11-07 01:53:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:53:33,779 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:53:33,779 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:53:33,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-11-07 01:53:34,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:53:34,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-07 01:53:34,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:53:34,383 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:53:34,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:53:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1656647341, now seen corresponding path program 1 times [2021-11-07 01:53:34,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:53:34,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547314032] [2021-11-07 01:53:34,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:53:34,383 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:53:34,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:53:34,385 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:53:34,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-07 01:54:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:54:03,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-07 01:54:03,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:54:51,604 WARN L207 SmtUtils]: Spent 18.69 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-07 01:55:36,460 WARN L207 SmtUtils]: Spent 17.84 s on a formula simplification that was a NOOP. DAG size: 34 [2021-11-07 01:56:09,672 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) c_ULTIMATE.start_main_~count~0)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) c_ULTIMATE.start_main_~count~0))))) (= (_ bv4 32) c_ULTIMATE.start_main_~count~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-07 01:57:14,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) c_ULTIMATE.start_main_~count~0)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (_ bv4 32) c_ULTIMATE.start_main_~count~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~oddExp~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-07 01:57:54,170 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) c_ULTIMATE.start_main_~count~0)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_ULTIMATE.start_main_~count~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~oddExp~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-07 01:57:56,450 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) c_ULTIMATE.start_main_~count~0)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_ULTIMATE.start_main_~count~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~oddExp~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-07 01:58:17,193 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) is different from false [2021-11-07 01:58:19,308 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) is different from true [2021-11-07 01:59:39,108 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2021-11-07 01:59:41,227 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2021-11-07 01:59:59,310 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))))) is different from false [2021-11-07 02:00:01,440 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))))) is different from true [2021-11-07 02:00:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-07 02:00:01,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:00:11,428 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from false [2021-11-07 02:00:13,525 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from true [2021-11-07 02:00:19,766 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from false [2021-11-07 02:00:21,843 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from true [2021-11-07 02:00:28,241 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from false [2021-11-07 02:00:30,365 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))))) is different from true [2021-11-07 02:00:41,251 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) c_ULTIMATE.start_main_~count~0)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) c_ULTIMATE.start_main_~count~0))))))))) is different from false [2021-11-07 02:00:43,468 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) c_ULTIMATE.start_main_~count~0)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) c_ULTIMATE.start_main_~count~0))))))))) is different from true [2021-11-07 02:00:50,049 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) c_ULTIMATE.start_main_~count~0)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) c_ULTIMATE.start_main_~count~0))))))))) is different from false [2021-11-07 02:00:52,242 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) c_ULTIMATE.start_main_~count~0)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) c_ULTIMATE.start_main_~count~0))))))))) is different from true [2021-11-07 02:00:58,978 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) c_ULTIMATE.start_main_~count~0)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) c_ULTIMATE.start_main_~count~0)))))))))) is different from false [2021-11-07 02:01:01,223 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) c_ULTIMATE.start_main_~count~0)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) c_ULTIMATE.start_main_~count~0)))))))))) is different from true [2021-11-07 02:01:07,723 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) is different from false [2021-11-07 02:01:09,892 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) is different from true [2021-11-07 02:01:21,046 WARN L838 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))) is different from false [2021-11-07 02:01:23,213 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))) is different from true [2021-11-07 02:01:39,675 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.lt v_ULTIMATE.start_main_~x~0_8 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-11-07 02:01:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-07 02:01:39,676 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:01:39,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547314032] [2021-11-07 02:01:39,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547314032] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:39,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980754193] [2021-11-07 02:01:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:39,677 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-07 02:01:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/cvc4 [2021-11-07 02:01:39,680 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-07 02:01:39,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296832f4-f719-4bb4-b8d7-6c81dc67890a/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-11-07 02:01:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:48,823 WARN L261 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-07 02:01:48,825 INFO L286 TraceCheckSpWp]: Computing forward predicates...