./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-6b4ec56 [2022-11-20 09:27:19,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:19,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:19,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:19,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:19,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:19,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:19,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:19,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:19,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:19,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:19,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:19,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:19,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:19,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:19,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:19,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:19,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:19,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:19,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:19,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:19,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:19,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:19,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:19,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:19,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:19,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:19,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:19,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:19,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:19,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:19,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:19,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:19,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:19,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:19,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:19,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:19,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:19,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:19,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:19,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:19,596 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:27:19,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:19,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:19,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:19,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:19,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:19,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:19,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:19,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:19,645 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:19,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:19,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:19,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:19,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:19,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:19,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:19,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:19,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:19,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:19,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:19,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:19,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:19,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:19,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:19,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:19,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:19,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:19,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:19,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:19,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:19,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:19,654 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:19,654 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:19,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:19,655 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_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-20 09:27:19,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:19,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:19,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:19,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:19,994 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:19,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-20 09:27:23,178 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:23,395 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:23,396 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/sv-benchmarks/c/float-benchs/filter1.c [2022-11-20 09:27:23,403 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/data/72e0d6035/56b76e8323fe461bb2951bca61728a3c/FLAGf873f0220 [2022-11-20 09:27:23,418 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/data/72e0d6035/56b76e8323fe461bb2951bca61728a3c [2022-11-20 09:27:23,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:23,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:23,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:23,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:23,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:23,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e06ede8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23, skipping insertion in model container [2022-11-20 09:27:23,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:23,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:23,637 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_ee95b3b7-a90b-4da4-976b-15b7170c2b60/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-20 09:27:23,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:23,670 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:23,685 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_ee95b3b7-a90b-4da4-976b-15b7170c2b60/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-20 09:27:23,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:23,711 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:23,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23 WrapperNode [2022-11-20 09:27:23,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:23,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:23,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:23,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:23,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,751 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-20 09:27:23,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:23,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:23,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:23,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:23,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,789 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:23,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:23,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:23,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:23,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:23,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:23,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:23,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:23,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:23,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:23,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:23,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:23,964 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:23,967 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:24,149 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:24,173 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:24,173 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 09:27:24,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:24 BoogieIcfgContainer [2022-11-20 09:27:24,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:24,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:24,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:24,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:24,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:23" (1/3) ... [2022-11-20 09:27:24,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee550e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:24, skipping insertion in model container [2022-11-20 09:27:24,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23" (2/3) ... [2022-11-20 09:27:24,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee550e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:24, skipping insertion in model container [2022-11-20 09:27:24,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:24" (3/3) ... [2022-11-20 09:27:24,197 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-20 09:27:24,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:24,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:27:24,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:24,295 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1219eee7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:24,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:27:24,300 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-20 09:27:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:27:24,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:24,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:24,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-20 09:27:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:24,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904242123] [2022-11-20 09:27:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,538 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-20 09:27:24,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:24,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904242123] [2022-11-20 09:27:24,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904242123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:24,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:24,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:24,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592839637] [2022-11-20 09:27:24,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:24,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:27:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:24,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:27:24,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:27:24,598 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-20 09:27:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:24,615 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-20 09:27:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:27:24,617 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-20 09:27:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:24,628 INFO L225 Difference]: With dead ends: 30 [2022-11-20 09:27:24,629 INFO L226 Difference]: Without dead ends: 12 [2022-11-20 09:27:24,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:27:24,637 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-20 09:27:24,638 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-20 09:27:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-20 09:27:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-20 09:27:24,664 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-20 09:27:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-20 09:27:24,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-20 09:27:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:24,667 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-20 09:27:24,667 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-20 09:27:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-20 09:27:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:27:24,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:24,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:24,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:24,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:24,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-20 09:27:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:24,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314267660] [2022-11-20 09:27:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:27:24,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:27:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:27:24,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:27:24,719 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:27:24,721 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 09:27:24,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:24,727 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-20 09:27:24,731 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:27:24,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:27:24 BoogieIcfgContainer [2022-11-20 09:27:24,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:27:24,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:27:24,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:27:24,758 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:27:24,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:24" (3/4) ... [2022-11-20 09:27:24,762 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:27:24,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:27:24,763 INFO L158 Benchmark]: Toolchain (without parser) took 1340.28ms. Allocated memory is still 159.4MB. Free memory was 123.8MB in the beginning and 76.0MB in the end (delta: 47.8MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:24,779 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 159.4MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:24,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.07ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 112.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 09:27:24,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.93ms. Allocated memory is still 159.4MB. Free memory was 112.9MB in the beginning and 111.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:24,781 INFO L158 Benchmark]: Boogie Preprocessor took 38.62ms. Allocated memory is still 159.4MB. Free memory was 111.6MB in the beginning and 110.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:24,781 INFO L158 Benchmark]: RCFGBuilder took 384.31ms. Allocated memory is still 159.4MB. Free memory was 110.3MB in the beginning and 100.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 09:27:24,782 INFO L158 Benchmark]: TraceAbstraction took 579.20ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 76.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:24,782 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 159.4MB. Free memory was 76.4MB in the beginning and 76.0MB in the end (delta: 390.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:24,785 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.31ms. Allocated memory is still 159.4MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.07ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 112.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.93ms. Allocated memory is still 159.4MB. Free memory was 112.9MB in the beginning and 111.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.62ms. Allocated memory is still 159.4MB. Free memory was 111.6MB in the beginning and 110.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.31ms. Allocated memory is still 159.4MB. Free memory was 110.3MB in the beginning and 100.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 579.20ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 76.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 159.4MB. Free memory was 76.4MB in the beginning and 76.0MB in the end (delta: 390.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 41, overapproximation of to_real at line 34. 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) VAL [\old(cond)=1, cond=1] [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 VAL [E0=53, i=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, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 09:27:24,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-6b4ec56 [2022-11-20 09:27:27,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:27,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:27,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:27,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:27,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:27,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:27,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:27,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:27,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:27,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:27,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:27,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:27,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:27,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:27,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:27,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:27,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:27,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:27,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:27,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:27,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:27,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:27,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:27,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:27,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:27,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:27,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:27,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:27,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:27,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:27,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:27,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:27,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:27,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:27,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:27,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:27,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:27,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:27,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:27,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:27,646 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 09:27:27,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:27,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:27,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:27,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:27,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:27,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:27,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:27,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:27,671 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:27,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:27,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:27,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:27,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:27,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:27,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:27,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:27,674 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:27:27,674 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:27:27,674 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:27:27,674 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:27,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:27,675 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:27,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:27,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:27,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:27,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:27,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:27,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:27,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:27,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:27,676 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:27:27,677 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:27:27,677 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:27,677 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:27,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:27,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:27:27,678 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_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-20 09:27:28,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:28,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:28,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:28,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:28,137 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:28,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-20 09:27:31,494 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:31,770 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:31,771 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/sv-benchmarks/c/float-benchs/filter1.c [2022-11-20 09:27:31,778 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/data/3311bd0e3/de2cc41d298a4c95bcd3783a4a9c0766/FLAGd95f3f14f [2022-11-20 09:27:31,797 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/data/3311bd0e3/de2cc41d298a4c95bcd3783a4a9c0766 [2022-11-20 09:27:31,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:31,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:31,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:31,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:31,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:31,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:31" (1/1) ... [2022-11-20 09:27:31,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af45b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:31, skipping insertion in model container [2022-11-20 09:27:31,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:31" (1/1) ... [2022-11-20 09:27:31,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:31,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:31,976 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_ee95b3b7-a90b-4da4-976b-15b7170c2b60/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-20 09:27:31,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:32,005 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:32,025 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_ee95b3b7-a90b-4da4-976b-15b7170c2b60/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-20 09:27:32,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:32,058 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:32,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32 WrapperNode [2022-11-20 09:27:32,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:32,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:32,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:32,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:32,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,097 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-20 09:27:32,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:32,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:32,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:32,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:32,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,129 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:32,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:32,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:32,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:32,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (1/1) ... [2022-11-20 09:27:32,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:32,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:32,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:32,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 09:27:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:32,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:32,319 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:32,322 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:34,530 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:34,536 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:34,536 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 09:27:34,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:34 BoogieIcfgContainer [2022-11-20 09:27:34,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:34,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:34,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:34,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:34,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:31" (1/3) ... [2022-11-20 09:27:34,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ff6934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:34, skipping insertion in model container [2022-11-20 09:27:34,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:32" (2/3) ... [2022-11-20 09:27:34,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ff6934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:34, skipping insertion in model container [2022-11-20 09:27:34,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:34" (3/3) ... [2022-11-20 09:27:34,546 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-20 09:27:34,566 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:34,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:27:34,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:34,626 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@98c19eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:34,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:27:34,631 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-20 09:27:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:27:34,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:34,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:34,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-20 09:27:34,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:27:34,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244873618] [2022-11-20 09:27:34,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:34,659 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-20 09:27:34,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:27:34,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:34,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 09:27:34,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:34,842 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-20 09:27:34,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:34,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:27:34,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244873618] [2022-11-20 09:27:34,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244873618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:34,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:34,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753526455] [2022-11-20 09:27:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:34,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:27:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:27:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:27:34,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:27:34,918 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-20 09:27:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:34,975 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-20 09:27:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:27:34,977 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-20 09:27:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:34,985 INFO L225 Difference]: With dead ends: 30 [2022-11-20 09:27:34,999 INFO L226 Difference]: Without dead ends: 12 [2022-11-20 09:27:35,002 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-20 09:27:35,005 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-20 09:27:35,006 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-20 09:27:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-20 09:27:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-20 09:27:35,064 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-20 09:27:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-20 09:27:35,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-20 09:27:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:35,067 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-20 09:27:35,068 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-20 09:27:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-20 09:27:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:27:35,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:35,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:35,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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)] Ended with exit code 0 [2022-11-20 09:27:35,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:35,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-20 09:27:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:27:35,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37875711] [2022-11-20 09:27:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:35,292 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-20 09:27:35,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:27:35,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:35,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 09:27:35,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:35,544 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-20 09:27:35,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:35,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:27:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37875711] [2022-11-20 09:27:35,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37875711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:35,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:35,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347364380] [2022-11-20 09:27:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:35,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:27:35,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:35,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:35,550 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-20 09:27:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:37,095 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-20 09:27:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:37,096 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-20 09:27:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:37,097 INFO L225 Difference]: With dead ends: 28 [2022-11-20 09:27:37,097 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 09:27:37,098 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-20 09:27:37,099 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:37,100 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.5s Time] [2022-11-20 09:27:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 09:27:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2022-11-20 09:27:37,104 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-20 09:27:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-20 09:27:37,105 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-11-20 09:27:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:37,106 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-20 09:27:37,106 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-20 09:27:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-20 09:27:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:27:37,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:37,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:37,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:37,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:37,316 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -274941459, now seen corresponding path program 1 times [2022-11-20 09:27:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:27:37,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998367724] [2022-11-20 09:27:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:37,318 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-20 09:27:37,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:27:37,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:37,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 09:27:37,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:38,875 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-20 09:27:38,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:38,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:27:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998367724] [2022-11-20 09:27:38,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998367724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:38,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:38,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007808692] [2022-11-20 09:27:38,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:38,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:27:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:38,878 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-20 09:27:41,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:27:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:41,862 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-11-20 09:27:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:27:41,862 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-20 09:27:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:41,864 INFO L225 Difference]: With dead ends: 24 [2022-11-20 09:27:41,865 INFO L226 Difference]: Without dead ends: 22 [2022-11-20 09:27:41,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:27:41,866 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:41,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 1 Unknown, 8 Unchecked, 2.7s Time] [2022-11-20 09:27:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-20 09:27:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-11-20 09:27:41,875 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-20 09:27:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-20 09:27:41,877 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-11-20 09:27:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:41,877 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-20 09:27:41,877 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-20 09:27:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-20 09:27:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:27:41,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:41,878 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:41,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:42,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:42,099 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1443795685, now seen corresponding path program 1 times [2022-11-20 09:27:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:27:42,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322858874] [2022-11-20 09:27:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:42,101 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-20 09:27:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:27:42,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:42,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:27:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 09:27:42,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:29,965 WARN L233 SmtUtils]: Spent 10.07s 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-20 09:28:40,399 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (fp.neg .cse0)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))))))) is different from false [2022-11-20 09:28:41,566 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-20 09:28:41,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:28:55,979 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-20 09:28:58,019 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-20 09:29:20,909 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-20 09:29:22,957 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-20 09:29:49,980 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-20 09:31:31,730 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-20 09:32:33,074 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-20 09:32:33,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:32:33,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322858874] [2022-11-20 09:32:33,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322858874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:32:33,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:32:33,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2022-11-20 09:32:33,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265713061] [2022-11-20 09:32:33,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:33,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 09:32:33,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:32:33,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 09:32:33,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=147, Unknown=23, NotChecked=150, Total=380 [2022-11-20 09:32:33,078 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 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-20 09:32:51,308 WARN L233 SmtUtils]: Spent 11.73s on a formula simplification. DAG size of input: 46 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:33:33,119 WARN L233 SmtUtils]: Spent 36.35s on a formula simplification. DAG size of input: 44 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:33:35,889 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse1)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.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| .cse1)) (.cse5 (fp.mul c_currentRoundingMode .cse9 .cse0)) (.cse4 (fp.neg .cse6)) (.cse8 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse2)) (.cse3 (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_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_6|) |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| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (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))) .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| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (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|) .cse4))) .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| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-11-20 09:33:38,043 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-20 09:33:40,704 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 (= |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_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)))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-20 09:33:43,274 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 (= |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_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)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-20 09:33:47,201 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-20 09:33:50,547 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-20 09:34:09,086 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:34:11,203 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 (fp.neg .cse5)) (.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|))) (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|) .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 .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (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 .cse4 |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| .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|) .cse5)))))) is different from true [2022-11-20 09:34:13,272 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) .cse4) (or (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.neg .cse5)) (.cse7 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (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| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .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| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1)))))) .cse4)))) is different from false [2022-11-20 09:34:15,347 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) .cse4) (or (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.neg .cse5)) (.cse7 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (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| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .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| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1)))))) .cse4)))) is different from true [2022-11-20 09:34:17,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse4 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (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.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (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 .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1))) (fp.leq .cse0 .cse5)))) is different from false [2022-11-20 09:34:19,490 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse4 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (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.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (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 .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1))) (fp.leq .cse0 .cse5)))) is different from true [2022-11-20 09:34:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:19,492 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-11-20 09:34:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 09:34:19,492 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 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 17 [2022-11-20 09:34:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:19,493 INFO L225 Difference]: With dead ends: 41 [2022-11-20 09:34:19,493 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 09:34:19,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 188.2s TimeCoverageRelationStatistics Valid=110, Invalid=248, Unknown=36, NotChecked=598, Total=992 [2022-11-20 09:34:19,495 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:19,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 34 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 1 Unknown, 126 Unchecked, 2.3s Time] [2022-11-20 09:34:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 09:34:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2022-11-20 09:34:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-11-20 09:34:19,515 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-11-20 09:34:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:19,515 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-11-20 09:34:19,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 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-20 09:34:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-11-20 09:34:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:34:19,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:19,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:19,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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)] Forceful destruction successful, exit code 0 [2022-11-20 09:34:19,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:34:19,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:34:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1185630247, now seen corresponding path program 1 times [2022-11-20 09:34:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:19,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74144285] [2022-11-20 09:34:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:19,726 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-20 09:34:19,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:19,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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-20 09:34:19,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95b3b7-a90b-4da4-976b-15b7170c2b60/bin/uautomizer-ug76WZFUDN/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 (6)] Waiting until timeout for monitored process [2022-11-20 09:34:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:21,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:34:21,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:51,674 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse1 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) |ULTIMATE.start_main_~E1~0#1|) .cse2)))) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 09:36:33,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse5 (fp.neg .cse6)) (.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4))) (or (and (or (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 (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (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.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse6)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|))) (and (fp.leq .cse7 .cse6) (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq .cse7 .cse5) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2022-11-20 09:37:05,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (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 (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse5))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (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.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))))) is different from false [2022-11-20 09:37:07,439 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (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 (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse5))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (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.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))))) is different from true [2022-11-20 09:37:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 09:37:07,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:37:18,314 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-20 09:37:20,377 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-20 09:37:43,713 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-20 09:37:45,778 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-20 09:38:13,207 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.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)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) is different from true [2022-11-20 09:39:31,453 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.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)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from true [2022-11-20 09:39:59,015 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse1))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) (not (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse4)) (not (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse1))))) is different from true [2022-11-20 09:40:35,474 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse4 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (not (fp.leq .cse0 .cse5))))) is different from false [2022-11-20 09:40:37,605 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse4 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (not (fp.leq .cse0 .cse5))))) is different from true [2022-11-20 09:41:54,298 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse4 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (not (fp.leq .cse0 .cse5)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from false [2022-11-20 09:41:56,440 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse4 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (not (fp.leq .cse0 .cse5)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from true