./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS --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 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:58:28,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:58:28,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:58:28,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:58:28,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:58:28,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:58:28,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:58:28,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:58:28,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:58:28,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:58:28,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:58:28,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:58:28,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:58:28,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:58:28,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:58:28,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:58:28,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:58:28,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:58:28,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:58:28,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:58:28,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:58:28,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:58:28,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:58:28,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:58:28,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:58:28,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:58:28,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:58:28,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:58:28,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:58:28,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:58:28,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:58:28,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:58:28,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:58:28,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:58:28,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:58:28,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:58:28,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:58:28,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:58:28,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:58:28,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:58:28,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:58:28,402 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:58:28,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:58:28,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:58:28,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:58:28,427 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:58:28,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:58:28,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:58:28,429 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:58:28,429 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:58:28,429 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:58:28,429 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:58:28,430 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:58:28,430 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:58:28,430 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:58:28,431 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:58:28,431 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:58:28,431 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:58:28,431 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:58:28,432 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:58:28,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:58:28,433 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:58:28,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:58:28,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:58:28,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:58:28,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:58:28,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:58:28,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:58:28,435 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:58:28,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:58:28,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:58:28,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:58:28,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:58:28,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:58:28,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:58:28,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:58:28,437 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:58:28,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:58:28,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:58:28,438 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:58:28,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:58:28,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:58:28,439 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:58:28,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/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_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS 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 -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2022-11-19 07:58:28,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:58:28,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:58:28,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:58:28,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:58:28,781 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:58:28,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2022-11-19 07:58:28,848 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data/62b8a737a/7d7162fb555f4cc4b612668693ed3d9a/FLAG26361edcb [2022-11-19 07:58:29,348 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:58:29,349 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2022-11-19 07:58:29,358 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data/62b8a737a/7d7162fb555f4cc4b612668693ed3d9a/FLAG26361edcb [2022-11-19 07:58:29,715 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data/62b8a737a/7d7162fb555f4cc4b612668693ed3d9a [2022-11-19 07:58:29,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:58:29,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:58:29,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:58:29,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:58:29,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:58:29,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:29" (1/1) ... [2022-11-19 07:58:29,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cadb9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:29, skipping insertion in model container [2022-11-19 07:58:29,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:29" (1/1) ... [2022-11-19 07:58:29,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:58:29,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:58:29,972 WARN L234 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_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2022-11-19 07:58:29,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:58:30,012 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:58:30,027 WARN L234 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_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2022-11-19 07:58:30,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:58:30,063 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:58:30,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30 WrapperNode [2022-11-19 07:58:30,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:58:30,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:58:30,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:58:30,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:58:30,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,105 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-11-19 07:58:30,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:58:30,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:58:30,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:58:30,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:58:30,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,145 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:58:30,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:58:30,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:58:30,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:58:30,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (1/1) ... [2022-11-19 07:58:30,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:58:30,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:58:30,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:58:30,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:58:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:58:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-19 07:58:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-19 07:58:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:58:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:58:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:58:30,303 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:58:30,305 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:58:30,510 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:58:30,533 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:58:30,533 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 07:58:30,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:30 BoogieIcfgContainer [2022-11-19 07:58:30,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:58:30,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:58:30,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:58:30,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:58:30,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:58:29" (1/3) ... [2022-11-19 07:58:30,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df06e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:30, skipping insertion in model container [2022-11-19 07:58:30,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:30" (2/3) ... [2022-11-19 07:58:30,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df06e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:30, skipping insertion in model container [2022-11-19 07:58:30,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:30" (3/3) ... [2022-11-19 07:58:30,546 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2022-11-19 07:58:30,566 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:58:30,566 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:58:30,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:58:30,628 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48b734b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:58:30,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:58:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:58:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:58:30,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:58:30,643 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:58:30,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:58:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:58:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1286672979, now seen corresponding path program 1 times [2022-11-19 07:58:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:58:30,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512744835] [2022-11-19 07:58:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:58:30,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:58:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:58:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:58:30,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:58:30,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512744835] [2022-11-19 07:58:30,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512744835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:58:30,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:58:30,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:58:30,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232145556] [2022-11-19 07:58:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:58:30,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:58:30,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:58:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:58:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:58:30,967 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:58:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:58:31,027 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-11-19 07:58:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:58:31,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2022-11-19 07:58:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:58:31,038 INFO L225 Difference]: With dead ends: 20 [2022-11-19 07:58:31,046 INFO L226 Difference]: Without dead ends: 12 [2022-11-19 07:58:31,049 INFO L412 NwaCegarLoop]: 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 [2022-11-19 07:58:31,052 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:58:31,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:58:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-19 07:58:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-19 07:58:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:58:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-19 07:58:31,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 12 [2022-11-19 07:58:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:58:31,121 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-19 07:58:31,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:58:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-19 07:58:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:58:31,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:58:31,126 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:58:31,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:58:31,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:58:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:58:31,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1194110661, now seen corresponding path program 1 times [2022-11-19 07:58:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:58:31,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049226391] [2022-11-19 07:58:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:58:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:58:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:58:31,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:58:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:58:31,262 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:58:31,262 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:58:31,265 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 07:58:31,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:58:31,272 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-19 07:58:31,276 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:58:31,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:58:31 BoogieIcfgContainer [2022-11-19 07:58:31,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:58:31,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:58:31,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:58:31,319 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:58:31,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:30" (3/4) ... [2022-11-19 07:58:31,324 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:58:31,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:58:31,326 INFO L158 Benchmark]: Toolchain (without parser) took 1606.30ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 54.9MB in the end (delta: 26.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-11-19 07:58:31,326 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 119.5MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:58:31,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.05ms. Allocated memory is still 119.5MB. Free memory was 81.1MB in the beginning and 94.4MB in the end (delta: -13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 07:58:31,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.34ms. Allocated memory is still 119.5MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:58:31,332 INFO L158 Benchmark]: Boogie Preprocessor took 40.67ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 91.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:58:31,335 INFO L158 Benchmark]: RCFGBuilder took 388.33ms. Allocated memory is still 119.5MB. Free memory was 91.7MB in the beginning and 80.8MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 07:58:31,336 INFO L158 Benchmark]: TraceAbstraction took 779.48ms. Allocated memory is still 119.5MB. Free memory was 80.5MB in the beginning and 55.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-19 07:58:31,337 INFO L158 Benchmark]: Witness Printer took 6.47ms. Allocated memory is still 119.5MB. Free memory was 55.3MB in the beginning and 54.9MB in the end (delta: 348.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:58:31,345 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.29ms. Allocated memory is still 119.5MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.05ms. Allocated memory is still 119.5MB. Free memory was 81.1MB in the beginning and 94.4MB in the end (delta: -13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.34ms. Allocated memory is still 119.5MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.67ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 91.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 388.33ms. Allocated memory is still 119.5MB. Free memory was 91.7MB in the beginning and 80.8MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 779.48ms. Allocated memory is still 119.5MB. Free memory was 80.5MB in the beginning and 55.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 6.47ms. Allocated memory is still 119.5MB. Free memory was 55.3MB in the beginning and 54.9MB in the end (delta: 348.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 22, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryArithmeticFLOAToperation at line 31. Possible FailurePath: [L20] float x = __VERIFIER_nondet_float() ; [L21] CALL assume_abort_if_not(x > -1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) [L21] RET assume_abort_if_not(x > -1.0) [L22] CALL assume_abort_if_not(x < 1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) [L22] RET assume_abort_if_not(x < 1.0) [L23] float exp = 1.0 ; [L24] float term = 1.0 ; [L25] unsigned int count = 1 ; [L26] float result = 2*(1/(1-x)) ; [L27] int temp ; VAL [count=1, exp=1, term=1] [L29] COND TRUE 1 [L31] term = term * (x/count) [L32] exp = exp + term [L33] count++ [L35] temp = __VERIFIER_nondet_int() [L36] COND TRUE temp ==0 VAL [count=2, temp=0] [L39] CALL __VERIFIER_assert( result >= exp ) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 12 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 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 [2022-11-19 07:58:31,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS --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 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:58:33,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:58:33,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:58:33,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:58:33,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:58:33,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:58:33,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:58:33,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:58:33,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:58:33,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:58:33,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:58:33,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:58:33,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:58:33,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:58:33,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:58:33,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:58:33,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:58:33,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:58:33,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:58:33,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:58:33,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:58:33,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:58:33,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:58:33,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:58:33,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:58:33,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:58:33,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:58:33,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:58:33,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:58:33,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:58:33,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:58:33,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:58:33,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:58:33,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:58:33,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:58:33,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:58:33,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:58:33,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:58:33,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:58:33,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:58:33,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:58:33,976 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-19 07:58:34,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:58:34,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:58:34,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:58:34,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:58:34,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:58:34,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:58:34,043 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:58:34,044 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:58:34,044 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:58:34,044 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:58:34,045 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:58:34,046 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:58:34,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:58:34,048 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:58:34,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:58:34,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:58:34,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:58:34,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:58:34,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:58:34,050 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:58:34,050 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:58:34,050 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:58:34,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:58:34,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:58:34,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:58:34,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:58:34,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:58:34,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:58:34,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:58:34,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:58:34,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:58:34,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:58:34,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:58:34,054 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:58:34,055 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:58:34,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:58:34,055 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:58:34,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:58:34,056 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_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/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_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS 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 -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2022-11-19 07:58:34,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:58:34,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:58:34,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:58:34,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:58:34,527 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:58:34,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2022-11-19 07:58:34,613 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data/6fe21df32/8f5efa6e78274d6b97699e0f1db93d7a/FLAG6f2bee370 [2022-11-19 07:58:35,125 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:58:35,125 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2022-11-19 07:58:35,132 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data/6fe21df32/8f5efa6e78274d6b97699e0f1db93d7a/FLAG6f2bee370 [2022-11-19 07:58:35,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/data/6fe21df32/8f5efa6e78274d6b97699e0f1db93d7a [2022-11-19 07:58:35,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:58:35,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:58:35,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:58:35,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:58:35,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:58:35,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b80c72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35, skipping insertion in model container [2022-11-19 07:58:35,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:58:35,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:58:35,704 WARN L234 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_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2022-11-19 07:58:35,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:58:35,746 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:58:35,791 WARN L234 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_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2022-11-19 07:58:35,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:58:35,829 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:58:35,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35 WrapperNode [2022-11-19 07:58:35,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:58:35,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:58:35,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:58:35,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:58:35,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,876 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-11-19 07:58:35,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:58:35,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:58:35,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:58:35,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:58:35,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,928 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:58:35,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:58:35,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:58:35,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:58:35,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (1/1) ... [2022-11-19 07:58:35,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:58:35,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:58:35,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:58:35,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:58:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:58:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:58:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-19 07:58:36,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-19 07:58:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:58:36,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:58:36,101 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:58:36,103 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:58:38,985 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:58:38,992 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:58:38,992 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 07:58:38,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:38 BoogieIcfgContainer [2022-11-19 07:58:38,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:58:39,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:58:39,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:58:39,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:58:39,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:58:35" (1/3) ... [2022-11-19 07:58:39,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a63e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:39, skipping insertion in model container [2022-11-19 07:58:39,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:35" (2/3) ... [2022-11-19 07:58:39,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a63e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:39, skipping insertion in model container [2022-11-19 07:58:39,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:38" (3/3) ... [2022-11-19 07:58:39,013 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2022-11-19 07:58:39,033 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:58:39,034 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:58:39,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:58:39,094 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23554c7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:58:39,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:58:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:58:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:58:39,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:58:39,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:58:39,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:58:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:58:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1019803906, now seen corresponding path program 1 times [2022-11-19 07:58:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:58:39,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699109188] [2022-11-19 07:58:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:58:39,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:58:39,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:58:39,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:58:39,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-19 07:58:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:58:39,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:58:39,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:58:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:58:39,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:58:39,693 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:58:39,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699109188] [2022-11-19 07:58:39,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699109188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:58:39,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:58:39,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:58:39,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498210132] [2022-11-19 07:58:39,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:58:39,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:58:39,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:58:39,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:58:39,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:58:39,765 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:58:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:58:39,784 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-11-19 07:58:39,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:58:39,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-19 07:58:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:58:39,807 INFO L225 Difference]: With dead ends: 35 [2022-11-19 07:58:39,809 INFO L226 Difference]: Without dead ends: 15 [2022-11-19 07:58:39,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:58:39,821 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:58:39,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:58:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-19 07:58:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-19 07:58:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:58:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-11-19 07:58:39,875 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 17 [2022-11-19 07:58:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:58:39,876 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-11-19 07:58:39,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:58:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-11-19 07:58:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:58:39,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:58:39,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:58:39,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:58:40,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:58:40,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:58:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:58:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1211444824, now seen corresponding path program 1 times [2022-11-19 07:58:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:58:40,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130603477] [2022-11-19 07:58:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:58:40,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:58:40,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:58:40,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:58:40,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-19 07:58:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:58:41,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 07:58:41,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:59:12,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|))) (and (= |c_ULTIMATE.start_main_~exp~0#1| .cse0) (= |c_ULTIMATE.start_main_~term~0#1| .cse0) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|))))) (fp.gt .cse2 (fp.neg .cse3)) (fp.lt .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-19 07:59:32,148 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse2 .cse1)))) is different from false [2022-11-19 07:59:34,192 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse2 .cse1)))) is different from true [2022-11-19 08:00:22,659 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven .cse2)) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.gt .cse0 .cse1) (fp.lt .cse0 .cse2) (not (fp.geq (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6))))))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.gt .cse7 .cse1) (fp.lt .cse7 .cse2) (fp.geq (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6))))))))))) is different from false [2022-11-19 08:00:38,992 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from false [2022-11-19 08:00:41,046 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from true [2022-11-19 08:00:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:00:41,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:00:41,047 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:00:41,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130603477] [2022-11-19 08:00:41,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130603477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:00:41,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:00:41,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 08:00:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856671148] [2022-11-19 08:00:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:00:41,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 08:00:41,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:00:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 08:00:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=28, Unknown=6, NotChecked=52, Total=110 [2022-11-19 08:00:41,052 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 08:00:45,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:00:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:00:45,417 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-11-19 08:00:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:00:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-19 08:00:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:00:45,472 INFO L225 Difference]: With dead ends: 21 [2022-11-19 08:00:45,472 INFO L226 Difference]: Without dead ends: 17 [2022-11-19 08:00:45,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=29, Invalid=37, Unknown=6, NotChecked=60, Total=132 [2022-11-19 08:00:45,474 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:00:45,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 1 Unknown, 41 Unchecked, 4.1s Time] [2022-11-19 08:00:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-19 08:00:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-19 08:00:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 08:00:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-11-19 08:00:45,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 18 [2022-11-19 08:00:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:00:45,484 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-11-19 08:00:45,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 08:00:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-11-19 08:00:45,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:00:45,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:00:45,486 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:00:45,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:00:45,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:00:45,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:00:45,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:00:45,688 INFO L85 PathProgramCache]: Analyzing trace with hash 311013171, now seen corresponding path program 1 times [2022-11-19 08:00:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:00:45,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232660829] [2022-11-19 08:00:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:00:45,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:00:45,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:00:45,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:00:45,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-19 08:00:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:00:51,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 08:00:51,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:01:23,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|))) (and (= |c_ULTIMATE.start_main_~exp~0#1| .cse0) (= |c_ULTIMATE.start_main_~term~0#1| .cse0) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|))))) (fp.gt .cse2 (fp.neg .cse3)) (fp.lt .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-19 08:01:52,508 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|))) (and (= |c_ULTIMATE.start_main_~exp~0#1| (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|))))) (fp.gt .cse2 (fp.neg .cse3)) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (fp.lt .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-19 08:02:41,858 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse3 (fp.neg .cse2)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse3 .cse2)))) is different from false [2022-11-19 08:02:43,915 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse3 (fp.neg .cse2)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse3 .cse2)))) is different from true [2022-11-19 08:03:33,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 (fp.neg .cse8)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse4 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse8)) (.cse5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.geq (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4))))) (fp.gt .cse6 .cse7) (fp.lt .cse6 .cse8)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.gt .cse9 .cse7) (not (fp.geq (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse10) (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))))) (fp.lt .cse9 .cse8)))))))) is different from false [2022-11-19 08:03:50,253 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1)))) is different from false [2022-11-19 08:03:52,318 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1)))) is different from true [2022-11-19 08:03:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-19 08:03:52,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:03:59,307 WARN L837 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) is different from false [2022-11-19 08:04:01,377 WARN L859 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) is different from true [2022-11-19 08:04:11,937 WARN L837 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))))) is different from false [2022-11-19 08:04:14,073 WARN L859 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))))) is different from true [2022-11-19 08:04:20,339 WARN L837 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from false [2022-11-19 08:04:22,432 WARN L859 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from true [2022-11-19 08:04:34,552 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from false [2022-11-19 08:04:36,640 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from true [2022-11-19 08:04:47,316 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|) .cse3)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2022-11-19 08:05:06,515 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|) .cse3)))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2022-11-19 08:05:22,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.gt .cse0 (fp.neg .cse1)))))) is different from false [2022-11-19 08:05:24,895 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.gt .cse0 (fp.neg .cse1)))))) is different from true [2022-11-19 08:05:24,896 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:05:24,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232660829] [2022-11-19 08:05:24,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232660829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:05:24,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [625219135] [2022-11-19 08:05:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:05:24,897 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:05:24,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:05:24,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:05:24,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-19 08:05:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:05:27,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 08:05:27,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:08:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-19 08:08:08,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:08:45,639 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|) .cse0) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2022-11-19 08:09:04,804 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|) .cse0) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2022-11-19 08:09:19,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [625219135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:09:19,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37582866] [2022-11-19 08:09:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:09:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:09:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:09:19,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:09:19,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb57f78-4996-47aa-b59d-0bdd6b767fc5/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:11:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:03,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 08:11:03,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:19,214 WARN L837 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2022-11-19 08:13:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-19 08:13:34,064 INFO L328 TraceCheckSpWp]: Computing backward predicates...