./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur --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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- 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-38b53e6 [2022-11-25 23:44:53,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:44:53,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:44:53,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:44:53,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:44:53,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:44:53,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:44:53,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:44:53,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:44:53,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:44:53,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:44:53,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:44:53,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:44:53,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:44:53,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:44:53,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:44:53,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:44:53,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:44:53,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:44:53,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:44:53,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:44:53,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:44:53,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:44:53,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:44:53,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:44:53,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:44:53,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:44:53,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:44:53,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:44:53,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:44:53,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:44:53,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:44:53,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:44:53,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:44:53,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:44:53,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:44:53,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:44:53,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:44:53,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:44:53,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:44:53,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:44:53,407 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:44:53,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:44:53,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:44:53,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:44:53,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:44:53,431 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:44:53,431 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:44:53,431 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:44:53,432 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:44:53,432 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:44:53,432 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:44:53,432 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:44:53,433 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:44:53,433 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:44:53,433 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:44:53,434 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:44:53,434 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:44:53,434 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:44:53,434 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:44:53,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:44:53,436 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:44:53,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:44:53,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:44:53,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:44:53,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:44:53,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:44:53,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:44:53,437 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:44:53,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:44:53,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:44:53,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:44:53,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:44:53,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:44:53,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:44:53,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:44:53,440 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:44:53,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:44:53,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:44:53,440 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:44:53,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:44:53,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:44:53,441 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:44:53,441 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_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-25 23:44:53,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:44:53,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:44:53,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:44:53,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:44:53,690 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:44:53,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-25 23:44:56,846 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:44:57,099 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:44:57,100 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/sv-benchmarks/c/float-benchs/filter1.c [2022-11-25 23:44:57,104 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/data/56158f384/a360184b37fa4fc8874f7e26a5bd9da0/FLAGa9d7c506f [2022-11-25 23:44:57,120 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/data/56158f384/a360184b37fa4fc8874f7e26a5bd9da0 [2022-11-25 23:44:57,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:44:57,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:44:57,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:44:57,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:44:57,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:44:57,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4197e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57, skipping insertion in model container [2022-11-25 23:44:57,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:44:57,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:44:57,297 WARN L237 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_59c933b8-f75a-4bef-973e-6a1fa8c9e803/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-25 23:44:57,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:44:57,325 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:44:57,336 WARN L237 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_59c933b8-f75a-4bef-973e-6a1fa8c9e803/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-25 23:44:57,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:44:57,354 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:44:57,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57 WrapperNode [2022-11-25 23:44:57,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:44:57,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:44:57,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:44:57,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:44:57,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,387 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-25 23:44:57,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:44:57,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:44:57,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:44:57,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:44:57,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,410 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:44:57,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:44:57,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:44:57,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:44:57,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (1/1) ... [2022-11-25 23:44:57,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:44:57,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:44:57,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:44:57,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:44:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:44:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:44:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:44:57,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:44:57,566 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:44:57,568 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:44:57,681 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:44:57,728 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:44:57,728 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 23:44:57,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:44:57 BoogieIcfgContainer [2022-11-25 23:44:57,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:44:57,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:44:57,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:44:57,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:44:57,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:44:57" (1/3) ... [2022-11-25 23:44:57,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f39f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:44:57, skipping insertion in model container [2022-11-25 23:44:57,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:44:57" (2/3) ... [2022-11-25 23:44:57,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f39f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:44:57, skipping insertion in model container [2022-11-25 23:44:57,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:44:57" (3/3) ... [2022-11-25 23:44:57,750 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-25 23:44:57,771 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:44:57,771 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:44:57,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:44:57,829 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;@64e5972f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:44:57,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 23:44:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:44:57,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:44:57,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:44:57,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:44:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:44:57,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2376458, now seen corresponding path program 1 times [2022-11-25 23:44:57,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:44:57,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72446835] [2022-11-25 23:44:57,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:57,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:44:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:44:57,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:44:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:44:57,995 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:44:57,997 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:44:57,999 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 23:44:58,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:44:58,006 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-25 23:44:58,011 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:44:58,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:44:58 BoogieIcfgContainer [2022-11-25 23:44:58,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:44:58,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:44:58,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:44:58,032 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:44:58,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:44:57" (3/4) ... [2022-11-25 23:44:58,036 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 23:44:58,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:44:58,037 INFO L158 Benchmark]: Toolchain (without parser) took 912.43ms. Allocated memory is still 151.0MB. Free memory was 121.1MB in the beginning and 81.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-25 23:44:58,038 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:44:58,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.93ms. Allocated memory is still 151.0MB. Free memory was 121.1MB in the beginning and 110.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 23:44:58,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.13ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 109.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:44:58,039 INFO L158 Benchmark]: Boogie Preprocessor took 28.20ms. Allocated memory is still 151.0MB. Free memory was 109.3MB in the beginning and 107.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:44:58,040 INFO L158 Benchmark]: RCFGBuilder took 323.60ms. Allocated memory is still 151.0MB. Free memory was 107.9MB in the beginning and 95.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 23:44:58,041 INFO L158 Benchmark]: TraceAbstraction took 287.38ms. Allocated memory is still 151.0MB. Free memory was 95.3MB in the beginning and 81.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 23:44:58,041 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 151.0MB. Free memory was 81.8MB in the beginning and 81.2MB in the end (delta: 581.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:44:58,044 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.22ms. Allocated memory is still 117.4MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.93ms. Allocated memory is still 151.0MB. Free memory was 121.1MB in the beginning and 110.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.13ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 109.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.20ms. Allocated memory is still 151.0MB. Free memory was 109.3MB in the beginning and 107.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.60ms. Allocated memory is still 151.0MB. Free memory was 107.9MB in the beginning and 95.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 287.38ms. Allocated memory is still 151.0MB. Free memory was 95.3MB in the beginning and 81.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 151.0MB. Free memory was 81.8MB in the beginning and 81.2MB in the end (delta: 581.0kB). Peak memory consumption was 2.1MB. 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: 17]: 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 31, overapproximation of to_real at line 34, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 VAL [i=0] [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L15] COND FALSE !(!cond) [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 [L39] E1 = E0 [L41] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 23:44:58,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur --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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- 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-38b53e6 [2022-11-25 23:45:00,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:45:00,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:45:00,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:45:00,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:45:00,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:45:00,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:45:00,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:45:00,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:45:00,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:45:00,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:45:00,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:45:00,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:45:00,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:45:00,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:45:00,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:45:00,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:45:00,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:45:00,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:45:00,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:45:00,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:45:00,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:45:00,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:45:00,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:45:00,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:45:00,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:45:00,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:45:00,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:45:00,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:45:00,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:45:00,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:45:00,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:45:00,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:45:00,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:45:00,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:45:00,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:45:00,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:45:00,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:45:00,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:45:00,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:45:00,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:45:00,751 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-25 23:45:00,776 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:45:00,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:45:00,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:45:00,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:45:00,778 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:45:00,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:45:00,779 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:45:00,779 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:45:00,779 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:45:00,779 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:45:00,780 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:45:00,780 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:45:00,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:45:00,781 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:45:00,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:45:00,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:45:00,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:45:00,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:45:00,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:45:00,782 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:45:00,782 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 23:45:00,782 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 23:45:00,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:45:00,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:45:00,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:45:00,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:45:00,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:45:00,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 23:45:00,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:45:00,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:45:00,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:45:00,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:45:00,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:45:00,785 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 23:45:00,785 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 23:45:00,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:45:00,786 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:45:00,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 23:45:00,786 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_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-25 23:45:01,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:45:01,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:45:01,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:45:01,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:45:01,127 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:45:01,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-25 23:45:04,294 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:45:04,505 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:45:04,505 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/sv-benchmarks/c/float-benchs/filter1.c [2022-11-25 23:45:04,513 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/data/fd150139d/0866b2cbfa1b4c7cb86ed1c68db7637e/FLAGf5fdd7dff [2022-11-25 23:45:04,539 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/data/fd150139d/0866b2cbfa1b4c7cb86ed1c68db7637e [2022-11-25 23:45:04,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:45:04,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:45:04,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:45:04,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:45:04,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:45:04,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360bbc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04, skipping insertion in model container [2022-11-25 23:45:04,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:45:04,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:45:04,724 WARN L237 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_59c933b8-f75a-4bef-973e-6a1fa8c9e803/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-25 23:45:04,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:45:04,755 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:45:04,769 WARN L237 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_59c933b8-f75a-4bef-973e-6a1fa8c9e803/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-25 23:45:04,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:45:04,789 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:45:04,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04 WrapperNode [2022-11-25 23:45:04,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:45:04,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:45:04,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:45:04,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:45:04,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,827 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-25 23:45:04,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:45:04,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:45:04,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:45:04,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:45:04,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:45:04,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:45:04,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:45:04,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:45:04,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (1/1) ... [2022-11-25 23:45:04,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:45:04,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:45:04,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:45:04,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:45:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:45:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 23:45:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:45:04,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:45:05,069 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:45:05,071 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:45:07,331 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:45:07,337 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:45:07,337 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 23:45:07,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:45:07 BoogieIcfgContainer [2022-11-25 23:45:07,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:45:07,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:45:07,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:45:07,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:45:07,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:45:04" (1/3) ... [2022-11-25 23:45:07,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c90b465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:45:07, skipping insertion in model container [2022-11-25 23:45:07,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:45:04" (2/3) ... [2022-11-25 23:45:07,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c90b465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:45:07, skipping insertion in model container [2022-11-25 23:45:07,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:45:07" (3/3) ... [2022-11-25 23:45:07,347 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-25 23:45:07,367 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:45:07,367 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:45:07,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:45:07,422 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;@3a2da8d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:45:07,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 23:45:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:45:07,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:07,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:07,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:45:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-25 23:45:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:45:07,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049804828] [2022-11-25 23:45:07,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:07,454 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-25 23:45:07,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:45:07,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:07,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:07,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 23:45:07,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:07,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:45:07,684 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:45:07,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049804828] [2022-11-25 23:45:07,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049804828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:45:07,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:45:07,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:45:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738557955] [2022-11-25 23:45:07,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:45:07,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:45:07,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:45:07,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:45:07,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:45:07,743 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:07,761 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-25 23:45:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:45:07,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:45:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:07,772 INFO L225 Difference]: With dead ends: 30 [2022-11-25 23:45:07,772 INFO L226 Difference]: Without dead ends: 12 [2022-11-25 23:45:07,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-25 23:45:07,781 INFO L413 NwaCegarLoop]: 17 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, 17 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-25 23:45:07,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:45:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-25 23:45:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-25 23:45:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-25 23:45:07,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-25 23:45:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:07,823 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-25 23:45:07,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-25 23:45:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:45:07,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:07,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:07,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:08,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:08,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:45:08,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-25 23:45:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:45:08,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292391787] [2022-11-25 23:45:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:08,046 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-25 23:45:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:45:08,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:08,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:08,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:45:08,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:08,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:45:08,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:45:08,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292391787] [2022-11-25 23:45:08,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292391787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:45:08,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:45:08,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:45:08,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621514404] [2022-11-25 23:45:08,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:45:08,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:45:08,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:45:08,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:45:08,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:45:08,281 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:09,447 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-25 23:45:09,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:45:09,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:45:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:09,449 INFO L225 Difference]: With dead ends: 28 [2022-11-25 23:45:09,449 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 23:45:09,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:45:09,451 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:09,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 23:45:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 23:45:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2022-11-25 23:45:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-25 23:45:09,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-11-25 23:45:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:09,455 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-25 23:45:09,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-25 23:45:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:45:09,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:09,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:09,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:09,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:09,658 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:45:09,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash -274941459, now seen corresponding path program 1 times [2022-11-25 23:45:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:45:09,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841710123] [2022-11-25 23:45:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:09,660 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-25 23:45:09,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:45:09,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:09,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:10,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:45:10,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:11,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:45:11,258 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:45:11,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841710123] [2022-11-25 23:45:11,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841710123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:45:11,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:45:11,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 23:45:11,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140960325] [2022-11-25 23:45:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:45:11,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:45:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:45:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:45:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:45:11,261 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:14,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:45:16,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:45:18,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:45:20,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:45:22,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:45:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:22,494 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-25 23:45:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:45:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:45:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:22,539 INFO L225 Difference]: With dead ends: 31 [2022-11-25 23:45:22,540 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 23:45:22,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:45:22,541 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:22,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 28 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 10.9s Time] [2022-11-25 23:45:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 23:45:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2022-11-25 23:45:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-25 23:45:22,547 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-11-25 23:45:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:22,548 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-25 23:45:22,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:45:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-25 23:45:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:45:22,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:22,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:22,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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)] Forceful destruction successful, exit code 0 [2022-11-25 23:45:22,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:22,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:45:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1443795685, now seen corresponding path program 1 times [2022-11-25 23:45:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:45:22,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122621520] [2022-11-25 23:45:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:22,759 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-25 23:45:22,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:45:22,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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-25 23:45:22,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/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 (5)] Waiting until timeout for monitored process [2022-11-25 23:45:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:23,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 23:45:23,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:51,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:03,931 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-25 23:46:05,980 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-25 23:46:28,833 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-25 23:46:30,878 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-25 23:46:57,891 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1))))))) is different from true [2022-11-25 23:48:37,811 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3)))))) is different from true [2022-11-25 23:49:37,559 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| (fp.neg .cse0))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0))))))) is different from true [2022-11-25 23:49:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 23:49:41,953 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:49:41,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122621520] [2022-11-25 23:49:41,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122621520] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:49:41,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1962720227] [2022-11-25 23:49:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:49:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:49:41,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:49:41,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-25 23:49:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:43,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:49:43,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:24,735 WARN L233 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:50:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:26,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:22,858 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) is different from true [2022-11-25 23:53:03,358 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse0 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) is different from true [2022-11-25 23:53:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-25 23:53:38,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1962720227] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:53:38,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358195731] [2022-11-25 23:53:38,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:38,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:38,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:53:38,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c933b8-f75a-4bef-973e-6a1fa8c9e803/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:53:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:41,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 23:53:41,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:47,452 WARN L233 SmtUtils]: Spent 18.73s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:55:02,548 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 (fp.neg .cse0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse3))))))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse3)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1)))))) is different from false [2022-11-25 23:55:04,558 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 (fp.neg .cse0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse3))))))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse3)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1)))))) is different from true [2022-11-25 23:55:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:04,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:01,519 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3))))))) is different from true [2022-11-25 23:57:42,032 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse0 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3))))))) is different from true [2022-11-25 23:58:24,647 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_12| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_12|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_12| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_12| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_12| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_12| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_12| .cse3)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_12|) (fp.neg .cse1))))))))) is different from false [2022-11-25 23:58:26,669 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_12| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_12|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_12| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_12| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_12| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_12| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_12| .cse3)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_12|) (fp.neg .cse1))))))))) is different from true [2022-11-25 23:58:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 23:58:35,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358195731] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:58:35,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:58:35,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 28 [2022-11-25 23:58:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031283026] [2022-11-25 23:58:35,440 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:58:35,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:58:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:58:35,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:58:35,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=201, Unknown=37, NotChecked=440, Total=756 [2022-11-25 23:58:35,443 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:58:37,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:58:39,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:58:40,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:58:42,972 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_12| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_12|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_12| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_12| .cse1)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_12| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_12| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_12| .cse1)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_12|) (fp.neg .cse3)))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-25 23:59:14,505 WARN L233 SmtUtils]: Spent 25.77s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:59:18,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:59:53,335 WARN L233 SmtUtils]: Spent 26.15s on a formula simplification. DAG size of input: 41 DAG size of output: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:59:55,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:59:57,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:00:01,007 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse1 (fp.neg .cse4)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4)) (.cse6 (fp.mul c_currentRoundingMode .cse9 .cse0)) (.cse8 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1)) (.cse3 (fp.neg .cse5)) (.cse2 (fp.mul c_currentRoundingMode .cse9 |c_ULTIMATE.start_main_~S~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) .cse7 (or (and .cse7 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse8) (and (or (not .cse8) (not .cse7)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) .cse8 (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse4)))))))) is different from true [2022-11-26 00:00:03,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:00:06,862 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse1)) (.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-26 00:00:08,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:00:13,620 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse1)) (.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-26 00:00:15,721 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse3)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse6 (fp.neg .cse7))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (or (let ((.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3))) .cse5) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse6) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse7) (or (let ((.cse8 (fp.mul c_currentRoundingMode .cse4 .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse7)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse7)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))))) .cse5) (let ((.cse10 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse6)) (.cse9 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse7))) (or (and .cse9 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse10) (and (or (not .cse10) (not .cse9)) .cse5))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-26 00:00:17,794 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse3)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse6 (fp.neg .cse7))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (or (let ((.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3))) .cse5) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse6) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse7) (or (let ((.cse8 (fp.mul c_currentRoundingMode .cse4 .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse7)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse7)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))))) .cse5) (let ((.cse10 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse6)) (.cse9 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse7))) (or (and .cse9 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse10) (and (or (not .cse10) (not .cse9)) .cse5))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-26 00:00:19,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:00:21,592 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse7 .cse0)) (.cse3 (fp.neg .cse6)) (.cse1 (fp.neg .cse4)) (.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse1) (fp.geq .cse2 .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq .cse2 .cse6) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-26 00:00:23,669 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse7 .cse0)) (.cse3 (fp.neg .cse6)) (.cse1 (fp.neg .cse4)) (.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse1) (fp.geq .cse2 .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq .cse2 .cse6) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-26 00:00:25,858 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse4)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse0 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_11|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_11| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_11| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) is different from true