./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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH --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-9ad7fb2 [2021-11-03 04:18:10,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:18:10,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:18:11,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:18:11,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:18:11,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:18:11,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:18:11,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:18:11,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:18:11,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:18:11,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:18:11,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:18:11,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:18:11,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:18:11,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:18:11,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:18:11,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:18:11,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:18:11,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:18:11,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:18:11,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:18:11,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:18:11,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:18:11,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:18:11,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:18:11,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:18:11,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:18:11,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:18:11,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:18:11,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:18:11,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:18:11,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:18:11,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:18:11,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:18:11,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:18:11,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:18:11,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:18:11,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:18:11,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:18:11,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:18:11,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:18:11,072 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 04:18:11,126 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:18:11,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:18:11,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:18:11,132 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:18:11,133 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:18:11,133 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:18:11,133 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:18:11,133 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:18:11,141 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:18:11,141 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:18:11,143 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:18:11,143 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:18:11,143 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:18:11,144 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:18:11,144 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:18:11,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:18:11,145 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:18:11,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:18:11,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:18:11,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:18:11,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:18:11,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:18:11,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:18:11,147 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:18:11,147 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:18:11,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:18:11,147 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:18:11,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:18:11,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:18:11,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:18:11,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:18:11,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:18:11,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:18:11,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:18:11,152 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:18:11,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:18:11,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:18:11,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:18:11,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:18:11,153 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_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/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_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH 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-03 04:18:11,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:18:11,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:18:11,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:18:11,500 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:18:11,503 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:18:11,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-03 04:18:11,587 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data/70385527b/d9d6e0b918434079921042cd3e10d3d3/FLAGfdaaa4175 [2021-11-03 04:18:12,131 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:18:12,131 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-03 04:18:12,139 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data/70385527b/d9d6e0b918434079921042cd3e10d3d3/FLAGfdaaa4175 [2021-11-03 04:18:12,493 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data/70385527b/d9d6e0b918434079921042cd3e10d3d3 [2021-11-03 04:18:12,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:18:12,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:18:12,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:18:12,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:18:12,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:18:12,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c03d6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12, skipping insertion in model container [2021-11-03 04:18:12,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:18:12,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:18:12,707 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_837158bb-b5e4-4a71-bf75-59670e199748/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-03 04:18:12,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:18:12,780 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:18:12,798 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_837158bb-b5e4-4a71-bf75-59670e199748/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-03 04:18:12,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:18:12,850 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:18:12,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12 WrapperNode [2021-11-03 04:18:12,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:18:12,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:18:12,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:18:12,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:18:12,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:18:12,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:18:12,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:18:12,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:18:12,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:18:12,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:18:12,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:18:12,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:18:12,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (1/1) ... [2021-11-03 04:18:12,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:18:12,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:18:12,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:18:13,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:18:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:18:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:18:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:18:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:18:13,514 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:18:13,514 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-03 04:18:13,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:18:13 BoogieIcfgContainer [2021-11-03 04:18:13,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:18:13,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:18:13,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:18:13,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:18:13,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:18:12" (1/3) ... [2021-11-03 04:18:13,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac84af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:18:13, skipping insertion in model container [2021-11-03 04:18:13,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:12" (2/3) ... [2021-11-03 04:18:13,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac84af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:18:13, skipping insertion in model container [2021-11-03 04:18:13,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:18:13" (3/3) ... [2021-11-03 04:18:13,531 INFO L111 eAbstractionObserver]: Analyzing ICFG loop3.c [2021-11-03 04:18:13,543 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:18:13,544 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 04:18:13,609 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:18:13,618 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-03 04:18:13,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 04:18:13,636 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-03 04:18:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 04:18:13,647 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:18:13,647 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 04:18:13,648 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:18:13,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:18:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 80052486, now seen corresponding path program 1 times [2021-11-03 04:18:13,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:18:13,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455423954] [2021-11-03 04:18:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:18:13,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:18:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:18:13,829 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-03 04:18:13,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:18:13,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455423954] [2021-11-03 04:18:13,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455423954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:18:13,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:18:13,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:18:13,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236850858] [2021-11-03 04:18:13,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 04:18:13,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:18:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 04:18:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 04:18:13,859 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-03 04:18:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:18:13,876 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-11-03 04:18:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 04:18:13,878 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-03 04:18:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:18:13,885 INFO L225 Difference]: With dead ends: 15 [2021-11-03 04:18:13,885 INFO L226 Difference]: Without dead ends: 7 [2021-11-03 04:18:13,888 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-03 04:18:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-11-03 04:18:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-11-03 04:18:13,914 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-03 04:18:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-11-03 04:18:13,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-11-03 04:18:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:18:13,917 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-11-03 04:18:13,917 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-03 04:18:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-11-03 04:18:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 04:18:13,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:18:13,919 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 04:18:13,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:18:13,920 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:18:13,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:18:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1807980756, now seen corresponding path program 1 times [2021-11-03 04:18:13,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:18:13,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666202743] [2021-11-03 04:18:13,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:18:13,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:18:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:18:13,980 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 04:18:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:18:14,044 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 04:18:14,044 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 04:18:14,047 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 04:18:14,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:18:14,053 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-03 04:18:14,057 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 04:18:14,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:18:14 BoogieIcfgContainer [2021-11-03 04:18:14,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 04:18:14,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 04:18:14,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 04:18:14,086 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 04:18:14,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:18:13" (3/4) ... [2021-11-03 04:18:14,091 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 04:18:14,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 04:18:14,093 INFO L168 Benchmark]: Toolchain (without parser) took 1590.22 ms. Allocated memory is still 117.4 MB. Free memory was 79.7 MB in the beginning and 51.1 MB in the end (delta: 28.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 16.1 GB. [2021-11-03 04:18:14,094 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 117.4 MB. Free memory was 91.2 MB in the beginning and 91.1 MB in the end (delta: 27.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:18:14,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.20 ms. Allocated memory is still 117.4 MB. Free memory was 79.5 MB in the beginning and 90.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 04:18:14,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.55 ms. Allocated memory is still 117.4 MB. Free memory was 90.3 MB in the beginning and 88.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:18:14,097 INFO L168 Benchmark]: Boogie Preprocessor took 38.17 ms. Allocated memory is still 117.4 MB. Free memory was 88.8 MB in the beginning and 87.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:18:14,098 INFO L168 Benchmark]: RCFGBuilder took 573.76 ms. Allocated memory is still 117.4 MB. Free memory was 87.8 MB in the beginning and 75.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-03 04:18:14,099 INFO L168 Benchmark]: TraceAbstraction took 566.64 ms. Allocated memory is still 117.4 MB. Free memory was 74.7 MB in the beginning and 51.1 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:18:14,099 INFO L168 Benchmark]: Witness Printer took 5.78 ms. Allocated memory is still 117.4 MB. Free memory is still 51.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:18:14,104 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.24 ms. Allocated memory is still 117.4 MB. Free memory was 91.2 MB in the beginning and 91.1 MB in the end (delta: 27.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 342.20 ms. Allocated memory is still 117.4 MB. Free memory was 79.5 MB in the beginning and 90.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.55 ms. Allocated memory is still 117.4 MB. Free memory was 90.3 MB in the beginning and 88.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.17 ms. Allocated memory is still 117.4 MB. Free memory was 88.8 MB in the beginning and 87.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 573.76 ms. Allocated memory is still 117.4 MB. Free memory was 87.8 MB in the beginning and 75.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 566.64 ms. Allocated memory is still 117.4 MB. Free memory was 74.7 MB in the beginning and 51.1 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.78 ms. Allocated memory is still 117.4 MB. Free memory is still 51.1 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.4s, 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-03 04:18:14,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/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_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH --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-9ad7fb2 [2021-11-03 04:18:17,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:18:17,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:18:17,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:18:17,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:18:17,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:18:17,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:18:17,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:18:17,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:18:17,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:18:17,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:18:17,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:18:17,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:18:17,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:18:17,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:18:17,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:18:17,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:18:17,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:18:17,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:18:17,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:18:17,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:18:17,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:18:17,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:18:17,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:18:17,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:18:17,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:18:17,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:18:17,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:18:17,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:18:17,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:18:17,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:18:17,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:18:17,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:18:17,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:18:17,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:18:17,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:18:17,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:18:17,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:18:17,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:18:17,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:18:17,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:18:17,154 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-03 04:18:17,211 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:18:17,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:18:17,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:18:17,214 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:18:17,214 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:18:17,214 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:18:17,215 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:18:17,215 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:18:17,215 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:18:17,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:18:17,219 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:18:17,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:18:17,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:18:17,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:18:17,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:18:17,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:18:17,220 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:18:17,221 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 04:18:17,221 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 04:18:17,221 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:18:17,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:18:17,222 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:18:17,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:18:17,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:18:17,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 04:18:17,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:18:17,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:18:17,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:18:17,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:18:17,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:18:17,224 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-03 04:18:17,225 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 04:18:17,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:18:17,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:18:17,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:18:17,226 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_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/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_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH 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-03 04:18:17,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:18:17,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:18:17,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:18:17,718 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:18:17,719 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:18:17,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-03 04:18:17,803 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data/66533c707/8208125f1aa546a09e7784ffb9339979/FLAG1f197d4ff [2021-11-03 04:18:18,410 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:18:18,411 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-03 04:18:18,423 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data/66533c707/8208125f1aa546a09e7784ffb9339979/FLAG1f197d4ff [2021-11-03 04:18:18,718 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/data/66533c707/8208125f1aa546a09e7784ffb9339979 [2021-11-03 04:18:18,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:18:18,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:18:18,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:18:18,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:18:18,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:18:18,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:18:18" (1/1) ... [2021-11-03 04:18:18,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b60f2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:18, skipping insertion in model container [2021-11-03 04:18:18,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:18:18" (1/1) ... [2021-11-03 04:18:18,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:18:18,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:18:18,991 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_837158bb-b5e4-4a71-bf75-59670e199748/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-03 04:18:19,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:18:19,055 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:18:19,072 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_837158bb-b5e4-4a71-bf75-59670e199748/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-03 04:18:19,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:18:19,122 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:18:19,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19 WrapperNode [2021-11-03 04:18:19,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:18:19,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:18:19,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:18:19,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:18:19,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:18:19,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:18:19,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:18:19,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:18:19,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:18:19,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:18:19,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:18:19,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:18:19,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (1/1) ... [2021-11-03 04:18:19,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:18:19,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:18:19,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:18:19,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:18:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 04:18:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:18:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:18:19,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:18:23,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:18:23,975 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-03 04:18:23,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:18:23 BoogieIcfgContainer [2021-11-03 04:18:23,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:18:23,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:18:23,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:18:23,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:18:23,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:18:18" (1/3) ... [2021-11-03 04:18:23,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a67a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:18:23, skipping insertion in model container [2021-11-03 04:18:23,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:18:19" (2/3) ... [2021-11-03 04:18:23,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a67a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:18:23, skipping insertion in model container [2021-11-03 04:18:23,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:18:23" (3/3) ... [2021-11-03 04:18:23,988 INFO L111 eAbstractionObserver]: Analyzing ICFG loop3.c [2021-11-03 04:18:23,995 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:18:23,995 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 04:18:24,075 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:18:24,085 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-03 04:18:24,085 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 04:18:24,099 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-03 04:18:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 04:18:24,118 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:18:24,119 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:18:24,120 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:18:24,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:18:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-11-03 04:18:24,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:18:24,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519661018] [2021-11-03 04:18:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:18:24,157 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:18:24,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:18:24,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:18:24,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 04:18:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:18:24,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-03 04:18:24,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:18:24,465 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-03 04:18:24,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:18:24,529 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-03 04:18:24,530 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:18:24,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519661018] [2021-11-03 04:18:24,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519661018] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:18:24,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:18:24,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 04:18:24,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225610295] [2021-11-03 04:18:24,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 04:18:24,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:18:24,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 04:18:24,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 04:18:24,565 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-03 04:18:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:18:24,584 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-11-03 04:18:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 04:18:24,586 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-03 04:18:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:18:24,596 INFO L225 Difference]: With dead ends: 29 [2021-11-03 04:18:24,597 INFO L226 Difference]: Without dead ends: 12 [2021-11-03 04:18:24,600 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-03 04:18:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-03 04:18:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-03 04:18:24,635 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-03 04:18:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-11-03 04:18:24,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-11-03 04:18:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:18:24,639 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-11-03 04:18:24,640 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-03 04:18:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-11-03 04:18:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:18:24,641 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:18:24,642 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:18:24,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-03 04:18:24,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:18:24,855 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:18:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:18:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-11-03 04:18:24,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:18:24,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122431194] [2021-11-03 04:18:24,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:18:24,858 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:18:24,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:18:24,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:18:24,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 04:18:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:18:25,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 04:18:25,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:18:25,933 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-03 04:18:25,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:18:26,088 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-03 04:18:26,089 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:18:26,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122431194] [2021-11-03 04:18:26,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122431194] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:18:26,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:18:26,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-03 04:18:26,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678574642] [2021-11-03 04:18:26,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:18:26,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:18:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:18:26,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:18:26,094 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-03 04:18:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:18:31,087 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-11-03 04:18:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:18:31,089 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-03 04:18:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:18:31,090 INFO L225 Difference]: With dead ends: 24 [2021-11-03 04:18:31,090 INFO L226 Difference]: Without dead ends: 16 [2021-11-03 04:18:31,091 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-03 04:18:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-03 04:18:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-11-03 04:18:31,095 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-03 04:18:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-03 04:18:31,096 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-11-03 04:18:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:18:31,096 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-03 04:18:31,097 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-03 04:18:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-03 04:18:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:18:31,098 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:18:31,098 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:18:31,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-03 04:18:31,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:18:31,319 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:18:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:18:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-11-03 04:18:31,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:18:31,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108223682] [2021-11-03 04:18:31,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:18:31,321 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:18:31,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:18:31,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:18:31,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 04:18:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:18:34,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-03 04:18:34,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:12,147 WARN L207 SmtUtils]: Spent 15.27 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-03 04:19:56,365 WARN L207 SmtUtils]: Spent 17.77 s on a formula simplification that was a NOOP. DAG size: 34 [2021-11-03 04:20:14,774 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-03 04:20:16,848 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-03 04:21:31,467 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-03 04:21:33,533 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-03 04:21:50,771 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-03 04:21:52,835 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-03 04:21:52,836 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-03 04:21:52,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:22:01,850 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-03 04:22:03,935 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-03 04:22:10,131 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-03 04:22:12,192 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-03 04:22:18,544 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-03 04:22:20,666 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-03 04:22:26,972 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-03 04:22:29,076 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-03 04:22:39,844 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-03 04:22:41,953 WARN L860 $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 true [2021-11-03 04:22:57,711 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-03 04:22:57,711 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-03 04:22:57,712 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:22:57,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108223682] [2021-11-03 04:22:57,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108223682] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:22:57,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:22:57,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-03 04:22:57,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142485669] [2021-11-03 04:22:57,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-03 04:22:57,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:22:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-03 04:22:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=67, Unknown=17, NotChecked=216, Total=342 [2021-11-03 04:22:57,716 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-03 04:22:59,823 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-03 04:23:01,936 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-03 04:23:04,045 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-03 04:23:06,162 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-03 04:23:08,267 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-03 04:23:10,391 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-03 04:23:12,502 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-03 04:23:14,626 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-03 04:23:16,740 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-03 04:23:18,815 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-03 04:23:20,926 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-03 04:23:23,022 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-03 04:23:25,136 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-03 04:23:27,256 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-03 04:23:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:23:43,851 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-11-03 04:23:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 04:23:43,852 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-03 04:23:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:23:43,853 INFO L225 Difference]: With dead ends: 20 [2021-11-03 04:23:43,853 INFO L226 Difference]: Without dead ends: 16 [2021-11-03 04:23:43,855 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 119.3s TimeCoverageRelationStatistics Valid=58, Invalid=69, Unknown=31, NotChecked=544, Total=702 [2021-11-03 04:23:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-03 04:23:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-03 04:23:43,861 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-03 04:23:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-11-03 04:23:43,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-11-03 04:23:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:23:43,862 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-11-03 04:23:43,875 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-03 04:23:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-11-03 04:23:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 04:23:43,875 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:23:43,876 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:23:43,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-03 04:23:44,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:23:44,099 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:23:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:23:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1599389039, now seen corresponding path program 1 times [2021-11-03 04:23:44,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:23:44,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601810275] [2021-11-03 04:23:44,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:23:44,101 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:23:44,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:23:44,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:23:44,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-03 04:23:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:23:45,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 04:23:45,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:23:45,808 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-03 04:23:45,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:23:46,065 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-03 04:23:46,066 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:23:46,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601810275] [2021-11-03 04:23:46,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601810275] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:23:46,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [634152076] [2021-11-03 04:23:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:23:46,068 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-03 04:23:46,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/cvc4 [2021-11-03 04:23:46,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-03 04:23:46,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-03 04:23:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:23:46,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 04:23:46,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:23:46,585 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-03 04:23:46,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:23:46,743 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-03 04:23:46,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [634152076] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:23:46,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168602952] [2021-11-03 04:23:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:23:46,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:23:46,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:23:46,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:23:46,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-03 04:23:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:23:47,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 04:23:47,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:23:48,145 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-03 04:23:48,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:23:48,303 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-03 04:23:48,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168602952] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:23:48,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-11-03 04:23:48,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2021-11-03 04:23:48,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354199955] [2021-11-03 04:23:48,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:23:48,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:23:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:23:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:23:48,314 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-03 04:23:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:23:58,066 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-03 04:23:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:23:58,067 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-03 04:23:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:23:58,068 INFO L225 Difference]: With dead ends: 35 [2021-11-03 04:23:58,069 INFO L226 Difference]: Without dead ends: 27 [2021-11-03 04:23:58,069 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-03 04:23:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-03 04:23:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-11-03 04:23:58,073 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-03 04:23:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-11-03 04:23:58,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-11-03 04:23:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:23:58,075 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-11-03 04:23:58,075 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-03 04:23:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-11-03 04:23:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 04:23:58,076 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:23:58,076 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:23:58,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-03 04:23:58,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2021-11-03 04:23:58,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-03 04:23:58,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:23:58,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:23:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:23:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1656647341, now seen corresponding path program 1 times [2021-11-03 04:23:58,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:23:58,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121581979] [2021-11-03 04:23:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:23:58,696 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:23:58,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:23:58,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:23:58,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-03 04:24:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:24:29,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-03 04:24:29,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:25:09,572 WARN L207 SmtUtils]: Spent 15.39 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-03 04:25:51,021 WARN L207 SmtUtils]: Spent 17.01 s on a formula simplification that was a NOOP. DAG size: 34 [2021-11-03 04:26:22,886 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-03 04:27:29,040 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-03 04:28:07,514 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-03 04:28:28,721 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-03 04:28:30,827 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-03 04:29:50,076 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-03 04:29:52,185 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-03 04:30:10,143 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-03 04:30:12,259 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-03 04:30:12,259 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-03 04:30:12,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:30:20,634 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-03 04:30:22,726 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-03 04:30:28,943 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-03 04:30:31,010 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-03 04:30:37,370 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-03 04:30:39,489 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-03 04:30:50,326 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-03 04:30:52,535 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-03 04:30:59,085 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-03 04:31:01,282 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-03 04:31:08,033 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-03 04:31:10,300 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-03 04:31:16,797 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-03 04:31:18,951 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-03 04:31:30,032 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-03 04:31:32,187 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-03 04:31:48,747 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-03 04:31:48,748 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-03 04:31:48,748 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:31:48,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121581979] [2021-11-03 04:31:48,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121581979] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:31:48,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1246954038] [2021-11-03 04:31:48,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:31:48,749 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-03 04:31:48,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/cvc4 [2021-11-03 04:31:48,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-03 04:31:48,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_837158bb-b5e4-4a71-bf75-59670e199748/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-11-03 04:31:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:31:57,330 WARN L261 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-03 04:31:57,332 INFO L286 TraceCheckSpWp]: Computing forward predicates...