./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/bary_diverge.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_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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_12db29b0-ee7d-4371-a889-ad173367e89d/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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- 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 10:41:32,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:41:32,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:41:32,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:41:32,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:41:32,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:41:32,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:41:32,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:41:32,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:41:32,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:41:32,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:41:32,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:41:32,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:41:32,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:41:32,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:41:32,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:41:32,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:41:32,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:41:32,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:41:32,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:41:32,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:41:32,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:41:32,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:41:32,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:41:32,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:41:32,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:41:32,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:41:32,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:41:32,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:41:32,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:41:32,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:41:32,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:41:32,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:41:32,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:41:32,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:41:32,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:41:32,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:41:32,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:41:32,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:41:32,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:41:32,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:41:32,197 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:41:32,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:41:32,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:41:32,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:41:32,223 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:41:32,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:41:32,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:41:32,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:41:32,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:41:32,225 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:41:32,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:41:32,226 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:41:32,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:41:32,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:41:32,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:41:32,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:41:32,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:41:32,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:41:32,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:41:32,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:41:32,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:41:32,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:41:32,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:41:32,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:41:32,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:41:32,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:41:32,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:41:32,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:41:32,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:41:32,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:41:32,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:41:32,230 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:41:32,231 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:41:32,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:41:32,231 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_12db29b0-ee7d-4371-a889-ad173367e89d/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_12db29b0-ee7d-4371-a889-ad173367e89d/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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2022-11-20 10:41:32,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:41:32,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:41:32,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:41:32,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:41:32,593 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:41:32,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/bary_diverge.c [2022-11-20 10:41:35,720 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:41:35,901 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:41:35,902 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/sv-benchmarks/c/float-benchs/bary_diverge.c [2022-11-20 10:41:35,909 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/data/19511c515/79e45bfa907647ceae20b3240efce118/FLAG22e29e135 [2022-11-20 10:41:35,924 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/data/19511c515/79e45bfa907647ceae20b3240efce118 [2022-11-20 10:41:35,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:41:35,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:41:35,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:41:35,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:41:35,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:41:35,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:41:35" (1/1) ... [2022-11-20 10:41:35,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27472e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:35, skipping insertion in model container [2022-11-20 10:41:35,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:41:35" (1/1) ... [2022-11-20 10:41:35,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:41:35,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:41:36,124 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_12db29b0-ee7d-4371-a889-ad173367e89d/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2022-11-20 10:41:36,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:41:36,164 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:41:36,181 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_12db29b0-ee7d-4371-a889-ad173367e89d/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2022-11-20 10:41:36,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:41:36,215 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:41:36,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36 WrapperNode [2022-11-20 10:41:36,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:41:36,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:41:36,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:41:36,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:41:36,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,259 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2022-11-20 10:41:36,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:41:36,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:41:36,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:41:36,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:41:36,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,278 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:41:36,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:41:36,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:41:36,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:41:36,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (1/1) ... [2022-11-20 10:41:36,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:41:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:41:36,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:41:36,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:41:36,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:41:36,365 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2022-11-20 10:41:36,365 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2022-11-20 10:41:36,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:41:36,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:41:36,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:41:36,477 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:41:36,479 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:41:36,656 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:41:36,662 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:41:36,662 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:41:36,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:41:36 BoogieIcfgContainer [2022-11-20 10:41:36,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:41:36,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:41:36,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:41:36,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:41:36,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:41:35" (1/3) ... [2022-11-20 10:41:36,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcd8871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:41:36, skipping insertion in model container [2022-11-20 10:41:36,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:36" (2/3) ... [2022-11-20 10:41:36,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcd8871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:41:36, skipping insertion in model container [2022-11-20 10:41:36,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:41:36" (3/3) ... [2022-11-20 10:41:36,690 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2022-11-20 10:41:36,716 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:41:36,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:41:36,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:41:36,809 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;@368b7543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:41:36,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:41:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:41:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:41:36,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:36,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:36,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:41:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 372835822, now seen corresponding path program 1 times [2022-11-20 10:41:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:41:36,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46035393] [2022-11-20 10:41:36,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:41:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:41:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:37,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:41:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:41:37,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:41:37,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46035393] [2022-11-20 10:41:37,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46035393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:37,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:37,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:41:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116968099] [2022-11-20 10:41:37,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:37,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:41:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:41:37,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:41:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:41:37,191 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:41:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:37,222 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-11-20 10:41:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:41:37,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-11-20 10:41:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:37,230 INFO L225 Difference]: With dead ends: 61 [2022-11-20 10:41:37,231 INFO L226 Difference]: Without dead ends: 28 [2022-11-20 10:41:37,234 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 10:41:37,238 INFO L413 NwaCegarLoop]: 38 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, 38 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 10:41:37,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:41:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-20 10:41:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-20 10:41:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:41:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-20 10:41:37,284 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2022-11-20 10:41:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:37,285 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-20 10:41:37,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:41:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-20 10:41:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:41:37,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:37,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:37,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:41:37,288 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:41:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -920244306, now seen corresponding path program 1 times [2022-11-20 10:41:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:41:37,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351863079] [2022-11-20 10:41:37,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:41:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:41:37,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:41:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:41:37,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:41:37,391 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:41:37,393 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:41:37,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:41:37,399 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-20 10:41:37,402 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:41:37,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:41:37 BoogieIcfgContainer [2022-11-20 10:41:37,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:41:37,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:41:37,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:41:37,444 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:41:37,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:41:36" (3/4) ... [2022-11-20 10:41:37,448 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:41:37,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:41:37,449 INFO L158 Benchmark]: Toolchain (without parser) took 1521.01ms. Allocated memory was 117.4MB in the beginning and 157.3MB in the end (delta: 39.8MB). Free memory was 76.9MB in the beginning and 95.9MB in the end (delta: -19.1MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-11-20 10:41:37,450 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 81.8MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:41:37,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.87ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 66.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 10:41:37,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.36ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 64.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:41:37,451 INFO L158 Benchmark]: Boogie Preprocessor took 21.03ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 63.3MB in the end (delta: 926.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:41:37,452 INFO L158 Benchmark]: RCFGBuilder took 386.19ms. Allocated memory was 117.4MB in the beginning and 157.3MB in the end (delta: 39.8MB). Free memory was 63.3MB in the beginning and 125.3MB in the end (delta: -61.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-11-20 10:41:37,453 INFO L158 Benchmark]: TraceAbstraction took 773.22ms. Allocated memory is still 157.3MB. Free memory was 124.3MB in the beginning and 95.9MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-20 10:41:37,453 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 157.3MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:41:37,456 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.27ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 81.8MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.87ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 66.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.36ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 64.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.03ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 63.3MB in the end (delta: 926.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.19ms. Allocated memory was 117.4MB in the beginning and 157.3MB in the end (delta: 39.8MB). Free memory was 63.3MB in the beginning and 125.3MB in the end (delta: -61.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 773.22ms. Allocated memory is still 157.3MB. Free memory was 124.3MB in the beginning and 95.9MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 157.3MB. Free memory is still 95.9MB. 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: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 50. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float C1, I; [L34] static float X,Y,Z; VAL [C1=0, I=0, INIT=0, X=0, Y=0, Z=0] [L55] int i; [L57] INIT = TRUE VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] CALL, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, C1=0, cond=1, I=0, INIT=1, X=0, Y=0, Z=0] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; VAL [\result=54, C1=0, I=0, INIT=1, X=0, x=54, Y=0, Z=0] [L58] RET, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, RANDOM_INPUT()=54, X=0, Y=0, Z=0] [L58] C1 = RANDOM_INPUT() [L59] CALL, EXPR RANDOM_INPUT() VAL [C1=54, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, C1=54, cond=1, I=0, INIT=1, X=0, Y=0, Z=0] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; VAL [\result=53, C1=54, I=0, INIT=1, x=53, X=0, Y=0, Z=0] [L59] RET, EXPR RANDOM_INPUT() VAL [C1=54, I=0, INIT=1, RANDOM_INPUT()=53, X=0, Y=0, Z=0] [L59] I = RANDOM_INPUT() [L61] i = 0 VAL [C1=54, I=53, i=0, INIT=1, X=0, Y=0, Z=0] [L61] COND TRUE i < 3600000 [L62] CALL bary() [L36] COND TRUE C1 > 0.f [L37] Z = Y [L38] Y = X VAL [C1=54, I=53, INIT=1, X=0, Y=0, Z=0] [L41] COND TRUE INIT == TRUE [L42] X = I [L43] Y = I [L44] Z = I VAL [C1=54, I=53, INIT=1, X=53, Y=53, Z=53] [L50] CALL __VERIFIER_assert(X >= -5.f && X <= 5.f) [L14] COND TRUE !(cond) VAL [\old(cond)=0, C1=54, cond=0, I=53, INIT=1, X=53, Y=53, Z=53] [L14] reach_error() VAL [\old(cond)=0, C1=54, cond=0, I=53, INIT=1, X=53, Y=53, Z=53] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 38 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, 38 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5/5 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 10:41:37,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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_12db29b0-ee7d-4371-a889-ad173367e89d/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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- 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 10:41:39,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:41:39,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:41:39,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:41:39,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:41:39,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:41:39,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:41:39,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:41:39,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:41:39,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:41:39,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:41:39,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:41:39,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:41:39,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:41:40,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:41:40,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:41:40,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:41:40,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:41:40,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:41:40,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:41:40,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:41:40,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:41:40,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:41:40,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:41:40,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:41:40,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:41:40,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:41:40,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:41:40,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:41:40,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:41:40,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:41:40,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:41:40,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:41:40,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:41:40,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:41:40,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:41:40,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:41:40,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:41:40,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:41:40,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:41:40,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:41:40,073 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 10:41:40,116 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:41:40,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:41:40,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:41:40,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:41:40,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:41:40,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:41:40,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:41:40,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:41:40,122 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:41:40,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:41:40,124 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:41:40,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:41:40,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:41:40,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:41:40,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:41:40,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:41:40,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:41:40,125 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:41:40,125 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:41:40,126 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:41:40,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:41:40,126 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:41:40,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:41:40,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:41:40,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:41:40,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:41:40,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:41:40,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:41:40,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:41:40,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:41:40,128 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:41:40,129 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:41:40,129 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:41:40,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:41:40,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:41:40,130 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:41:40,130 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_12db29b0-ee7d-4371-a889-ad173367e89d/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_12db29b0-ee7d-4371-a889-ad173367e89d/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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2022-11-20 10:41:40,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:41:40,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:41:40,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:41:40,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:41:40,595 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:41:40,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/bary_diverge.c [2022-11-20 10:41:43,822 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:41:44,026 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:41:44,027 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/sv-benchmarks/c/float-benchs/bary_diverge.c [2022-11-20 10:41:44,035 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/data/2303a15f6/90528d15b47c41bd8308038afbda962c/FLAG2df1c9194 [2022-11-20 10:41:44,050 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/data/2303a15f6/90528d15b47c41bd8308038afbda962c [2022-11-20 10:41:44,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:41:44,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:41:44,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:41:44,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:41:44,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:41:44,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797121f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44, skipping insertion in model container [2022-11-20 10:41:44,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:41:44,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:41:44,285 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_12db29b0-ee7d-4371-a889-ad173367e89d/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2022-11-20 10:41:44,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:41:44,320 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:41:44,334 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_12db29b0-ee7d-4371-a889-ad173367e89d/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2022-11-20 10:41:44,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:41:44,356 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:41:44,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44 WrapperNode [2022-11-20 10:41:44,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:41:44,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:41:44,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:41:44,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:41:44,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,395 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 70 [2022-11-20 10:41:44,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:41:44,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:41:44,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:41:44,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:41:44,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,421 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:41:44,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:41:44,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:41:44,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:41:44,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (1/1) ... [2022-11-20 10:41:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:41:44,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:41:44,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:41:44,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:41:44,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:41:44,522 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2022-11-20 10:41:44,524 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2022-11-20 10:41:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 10:41:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:41:44,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:41:44,644 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:41:44,646 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:41:46,924 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:41:46,931 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:41:46,931 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:41:46,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:41:46 BoogieIcfgContainer [2022-11-20 10:41:46,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:41:46,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:41:46,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:41:46,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:41:46,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:41:44" (1/3) ... [2022-11-20 10:41:46,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6882a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:41:46, skipping insertion in model container [2022-11-20 10:41:46,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:44" (2/3) ... [2022-11-20 10:41:46,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6882a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:41:46, skipping insertion in model container [2022-11-20 10:41:46,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:41:46" (3/3) ... [2022-11-20 10:41:46,962 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2022-11-20 10:41:46,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:41:47,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:41:47,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:41:47,120 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;@975dc51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:41:47,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:41:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:41:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:41:47,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:47,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:47,141 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:41:47,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash 372835822, now seen corresponding path program 1 times [2022-11-20 10:41:47,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:47,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428195332] [2022-11-20 10:41:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:47,168 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 10:41:47,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:47,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:47,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:47,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 10:41:47,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:41:47,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:41:47,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:47,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428195332] [2022-11-20 10:41:47,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428195332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:47,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:47,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:41:47,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90454918] [2022-11-20 10:41:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:47,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:41:47,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:47,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:41:47,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:41:47,455 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:41:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:47,499 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-11-20 10:41:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:41:47,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-11-20 10:41:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:47,510 INFO L225 Difference]: With dead ends: 61 [2022-11-20 10:41:47,510 INFO L226 Difference]: Without dead ends: 28 [2022-11-20 10:41:47,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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 10:41:47,519 INFO L413 NwaCegarLoop]: 38 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, 38 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 10:41:47,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:41:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-20 10:41:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-20 10:41:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:41:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-20 10:41:47,571 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2022-11-20 10:41:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:47,572 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-20 10:41:47,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:41:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-20 10:41:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:41:47,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:47,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:47,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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)] Forceful destruction successful, exit code 0 [2022-11-20 10:41:47,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:47,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:41:47,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash -920244306, now seen corresponding path program 1 times [2022-11-20 10:41:47,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:47,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844468312] [2022-11-20 10:41:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:47,799 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 10:41:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:47,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:47,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:47,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:41:47,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:41:48,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:41:48,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:48,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844468312] [2022-11-20 10:41:48,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844468312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:48,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:48,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:41:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759239758] [2022-11-20 10:41:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:48,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:41:48,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:48,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:41:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:41:48,643 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:51,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 10:41:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:52,662 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-11-20 10:41:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:41:52,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-20 10:41:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:52,665 INFO L225 Difference]: With dead ends: 54 [2022-11-20 10:41:52,665 INFO L226 Difference]: Without dead ends: 52 [2022-11-20 10:41:52,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:41:52,667 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 58 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:52,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-11-20 10:41:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-20 10:41:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-11-20 10:41:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 10:41:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-11-20 10:41:52,680 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 22 [2022-11-20 10:41:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:52,681 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-11-20 10:41:52,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-11-20 10:41:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:41:52,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:52,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:52,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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)] Ended with exit code 0 [2022-11-20 10:41:52,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:52,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:41:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash -920184724, now seen corresponding path program 1 times [2022-11-20 10:41:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:52,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227918549] [2022-11-20 10:41:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:52,897 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 10:41:52,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:52,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:52,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:53,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:41:53,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:41:53,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:41:53,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:53,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227918549] [2022-11-20 10:41:53,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227918549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:53,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:53,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:41:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601343524] [2022-11-20 10:41:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:53,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:41:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:41:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:41:53,340 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:55,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 10:41:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:55,492 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-11-20 10:41:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:41:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-20 10:41:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:55,521 INFO L225 Difference]: With dead ends: 85 [2022-11-20 10:41:55,522 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 10:41:55,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:41:55,524 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:55,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-20 10:41:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 10:41:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-11-20 10:41:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 10:41:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-11-20 10:41:55,536 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2022-11-20 10:41:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:55,537 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-11-20 10:41:55,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-11-20 10:41:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:41:55,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:55,539 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:55,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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)] Ended with exit code 0 [2022-11-20 10:41:55,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:55,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:41:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash -961441789, now seen corresponding path program 1 times [2022-11-20 10:41:55,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:55,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410147039] [2022-11-20 10:41:55,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:55,756 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 10:41:55,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:55,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:55,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:41:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:55,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:41:55,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 10:41:56,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:41:56,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:56,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410147039] [2022-11-20 10:41:56,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410147039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:56,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:56,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:41:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369411947] [2022-11-20 10:41:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:56,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:41:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:56,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:41:56,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:41:56,440 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:41:59,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 10:42:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:00,282 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-11-20 10:42:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:42:00,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-11-20 10:42:00,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:00,284 INFO L225 Difference]: With dead ends: 83 [2022-11-20 10:42:00,285 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 10:42:00,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:42:00,286 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:00,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 217 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-11-20 10:42:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 10:42:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-11-20 10:42:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 10:42:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-20 10:42:00,308 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 52 [2022-11-20 10:42:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:00,309 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-20 10:42:00,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:42:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-20 10:42:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:42:00,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:00,311 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:42:00,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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)] Ended with exit code 0 [2022-11-20 10:42:00,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:42:00,524 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:42:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash -961382207, now seen corresponding path program 1 times [2022-11-20 10:42:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:42:00,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79621306] [2022-11-20 10:42:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:00,525 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 10:42:00,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:42:00,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:42:00,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:42:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:42:01,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:42:48,848 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:43:35,847 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 (fp.neg .cse2)) (.cse4 (fp.neg .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)))) (and (fp.leq ~Z~0 .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3) (fp.geq ~Z~0 .cse4))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse2)) (fp.leq ~Z~0 .cse0) (fp.geq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse3)) (fp.geq ~Z~0 .cse4)))))))) is different from false [2022-11-20 10:44:01,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from false [2022-11-20 10:44:03,322 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from true [2022-11-20 10:44:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 15 refuted. 1 times theorem prover too weak. 16 trivial. 1 not checked. [2022-11-20 10:44:03,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:17,765 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-11-20 10:44:19,797 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-11-20 10:44:30,073 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-20 10:44:32,102 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-20 10:46:28,517 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-20 10:46:53,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-11-20 10:46:55,137 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-11-20 10:47:20,286 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_9| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_9|) (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_#t~ret6#1_9|)) .cse5))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_9| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_9|) (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.neg .cse5))))))) is different from false [2022-11-20 10:47:22,340 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_9| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_9|) (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_#t~ret6#1_9|)) .cse5))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_9| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_9|) (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.neg .cse5))))))) is different from true [2022-11-20 10:47:22,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:47:22,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79621306] [2022-11-20 10:47:22,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79621306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:22,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [51764826] [2022-11-20 10:47:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:22,343 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 10:47:22,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 10:47:22,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 10:47:22,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-20 10:47:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:23,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 10:47:23,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:49,028 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse5 (fp.neg .cse4))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse5))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse5)))))) is different from false [2022-11-20 10:48:51,044 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse5 (fp.neg .cse4))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse5))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse5)))))) is different from true [2022-11-20 10:48:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 15 refuted. 1 times theorem prover too weak. 16 trivial. 1 not checked. [2022-11-20 10:48:51,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:50:52,524 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from false [2022-11-20 10:50:54,560 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from true [2022-11-20 10:51:13,100 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq c_~X~0 .cse2)) (not (fp.geq c_~X~0 .cse1))))) is different from false [2022-11-20 10:51:15,141 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq c_~X~0 .cse2)) (not (fp.geq c_~X~0 .cse1))))) is different from true [2022-11-20 10:51:31,191 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_~I~0 .cse1)) (not (fp.leq c_~I~0 .cse2))))) is different from false [2022-11-20 10:51:33,225 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_~I~0 .cse1)) (not (fp.leq c_~I~0 .cse2))))) is different from true [2022-11-20 10:52:16,423 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse0 (fp.neg .cse2))) (or (not (fp.geq |c_ULTIMATE.start_main_#t~ret6#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.leq |c_ULTIMATE.start_main_#t~ret6#1| .cse2))))) is different from false [2022-11-20 10:52:18,452 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse0 (fp.neg .cse2))) (or (not (fp.geq |c_ULTIMATE.start_main_#t~ret6#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.leq |c_ULTIMATE.start_main_#t~ret6#1| .cse2))))) is different from true [2022-11-20 10:52:52,630 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 5.0)) (.cse5 (fp.neg .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_12| (_ FloatingPoint 8 24))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_12|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.neg .cse3)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_12| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_12|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_12|)) .cse3) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse5))))))) is different from false [2022-11-20 10:52:54,685 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 5.0)) (.cse5 (fp.neg .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_12| (_ FloatingPoint 8 24))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_12|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.neg .cse3)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_12| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_12|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_12|)) .cse3) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse5))))))) is different from true [2022-11-20 10:52:54,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [51764826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:54,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:52:54,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 13 [2022-11-20 10:52:54,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025362016] [2022-11-20 10:52:54,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:54,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:52:54,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:52:54,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:52:54,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=127, Unknown=41, NotChecked=468, Total=702 [2022-11-20 10:52:54,688 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:53:21,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 10:53:23,376 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 (fp.neg .cse2)) (.cse4 (fp.neg .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)))) (and (fp.leq ~Z~0 .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3) (fp.geq ~Z~0 .cse4))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse2)) (fp.leq ~Z~0 .cse0) (fp.geq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse3)) (fp.geq ~Z~0 .cse4)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 10:53:25,437 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse6 (fp.neg .cse4))) (let ((.cse5 (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse6))))) (and (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) .cse5) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse6))) .cse5))))) is different from false [2022-11-20 10:53:27,465 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse6 (fp.neg .cse4))) (let ((.cse5 (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse6))))) (and (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) .cse5) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse6))) .cse5))))) is different from true [2022-11-20 10:53:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:32,144 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2022-11-20 10:53:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:53:32,145 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-11-20 10:53:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:32,146 INFO L225 Difference]: With dead ends: 109 [2022-11-20 10:53:32,147 INFO L226 Difference]: Without dead ends: 107 [2022-11-20 10:53:32,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 129.9s TimeCoverageRelationStatistics Valid=153, Invalid=357, Unknown=56, NotChecked=840, Total=1406 [2022-11-20 10:53:32,149 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 76 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:32,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 172 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 142 Invalid, 1 Unknown, 227 Unchecked, 3.3s Time] [2022-11-20 10:53:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-20 10:53:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2022-11-20 10:53:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:53:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2022-11-20 10:53:32,165 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 52 [2022-11-20 10:53:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:32,166 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2022-11-20 10:53:32,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:53:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2022-11-20 10:53:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-20 10:53:32,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:32,169 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:32,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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)] Forceful destruction successful, exit code 0 [2022-11-20 10:53:32,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:53:32,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt [2022-11-20 10:53:32,594 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:32,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:32,595 INFO L85 PathProgramCache]: Analyzing trace with hash -77572522, now seen corresponding path program 2 times [2022-11-20 10:53:32,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:53:32,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016550863] [2022-11-20 10:53:32,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:53:32,596 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 10:53:32,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:53:32,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 10:53:32,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12db29b0-ee7d-4371-a889-ad173367e89d/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 (8)] Waiting until timeout for monitored process [2022-11-20 10:53:33,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:53:33,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:53:33,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:53:33,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:46,350 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.geq ~Z~0 (fp.neg .cse0)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) ~Z~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) ~Z~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) ~Z~0)) c_~X~0) (fp.leq ~Z~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 10:54:35,127 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 (fp.neg .cse2)) (.cse4 (fp.neg .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)))) (and (fp.leq ~Z~0 .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3) (fp.geq ~Z~0 .cse4))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse2)) (fp.leq ~Z~0 .cse0) (fp.geq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse3)) (fp.geq ~Z~0 .cse4)))))))) is different from false [2022-11-20 10:54:37,144 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 (fp.neg .cse2)) (.cse4 (fp.neg .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)))) (and (fp.leq ~Z~0 .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3) (fp.geq ~Z~0 .cse4))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse2)) (fp.leq ~Z~0 .cse0) (fp.geq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse3)) (fp.geq ~Z~0 .cse4)))))))) is different from true [2022-11-20 10:55:05,870 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse5 (fp.neg .cse4))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse5))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse5)))))) is different from false [2022-11-20 10:55:07,889 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse5 (fp.neg .cse4))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse5))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse5)))))) is different from true [2022-11-20 10:55:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 94 proven. 18 refuted. 0 times theorem prover too weak. 49 trivial. 4 not checked. [2022-11-20 10:55:07,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:18,326 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-11-20 10:55:20,366 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-11-20 10:55:30,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-20 10:55:32,685 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true