./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:41:50,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:41:50,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:41:50,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:41:50,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:41:50,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:41:50,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:41:50,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:41:50,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:41:50,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:41:50,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:41:50,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:41:50,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:41:50,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:41:50,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:41:50,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:41:50,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:41:50,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:41:50,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:41:50,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:41:50,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:41:50,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:41:50,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:41:50,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:41:50,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:41:50,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:41:50,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:41:50,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:41:50,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:41:50,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:41:50,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:41:50,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:41:50,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:41:50,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:41:50,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:41:50,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:41:50,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:41:50,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:41:50,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:41:50,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:41:50,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:41:50,809 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:41:50,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:41:50,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:41:50,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:41:50,862 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:41:50,863 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:41:50,863 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:41:50,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:41:50,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:41:50,864 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:41:50,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:41:50,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:41:50,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:41:50,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:41:50,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:41:50,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:41:50,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:41:50,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:41:50,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:41:50,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:41:50,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:41:50,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:41:50,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:41:50,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:41:50,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:41:50,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:41:50,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:41:50,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:41:50,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:41:50,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:41:50,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:41:50,871 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:41:50,871 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:41:50,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:41:50,872 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_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-11-18 20:41:51,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:41:51,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:41:51,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:41:51,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:41:51,264 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:41:51,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-11-18 20:41:51,344 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data/28b5a2097/4aac444a84634715b33ea6312bd77d37/FLAGe44f6412d [2022-11-18 20:41:51,921 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:41:51,922 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/sv-benchmarks/c/float-benchs/loop-1.c [2022-11-18 20:41:51,929 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data/28b5a2097/4aac444a84634715b33ea6312bd77d37/FLAGe44f6412d [2022-11-18 20:41:52,292 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data/28b5a2097/4aac444a84634715b33ea6312bd77d37 [2022-11-18 20:41:52,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:41:52,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:41:52,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:41:52,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:41:52,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:41:52,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d17fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52, skipping insertion in model container [2022-11-18 20:41:52,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:41:52,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:41:52,571 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-18 20:41:52,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:41:52,601 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:41:52,615 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-18 20:41:52,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:41:52,634 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:41:52,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52 WrapperNode [2022-11-18 20:41:52,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:41:52,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:41:52,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:41:52,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:41:52,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,677 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-18 20:41:52,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:41:52,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:41:52,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:41:52,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:41:52,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,716 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:41:52,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:41:52,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:41:52,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:41:52,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (1/1) ... [2022-11-18 20:41:52,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:41:52,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:41:52,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:41:52,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:41:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:41:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:41:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:41:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:41:52,919 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:41:52,923 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:41:53,101 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:41:53,109 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:41:53,109 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:41:53,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:41:53 BoogieIcfgContainer [2022-11-18 20:41:53,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:41:53,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:41:53,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:41:53,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:41:53,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:41:52" (1/3) ... [2022-11-18 20:41:53,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc93a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:41:53, skipping insertion in model container [2022-11-18 20:41:53,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:52" (2/3) ... [2022-11-18 20:41:53,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc93a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:41:53, skipping insertion in model container [2022-11-18 20:41:53,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:41:53" (3/3) ... [2022-11-18 20:41:53,125 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-11-18 20:41:53,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:41:53,151 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:41:53,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:41:53,248 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;@5f9366ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:41:53,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:41:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:41:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:41:53,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:41:53,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:41:53,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:41:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:41:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-18 20:41:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:41:53,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638576778] [2022-11-18 20:41:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:41:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:41:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:41:53,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:41:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:41:53,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:41:53,475 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:41:53,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:41:53,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:41:53,485 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-18 20:41:53,490 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:41:53,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:41:53 BoogieIcfgContainer [2022-11-18 20:41:53,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:41:53,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:41:53,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:41:53,515 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:41:53,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:41:53" (3/4) ... [2022-11-18 20:41:53,520 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:41:53,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:41:53,522 INFO L158 Benchmark]: Toolchain (without parser) took 1221.22ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 53.1MB in the beginning and 62.2MB in the end (delta: -9.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-11-18 20:41:53,523 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:41:53,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.58ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.9MB in the beginning and 87.9MB in the end (delta: -35.0MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-11-18 20:41:53,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 111.1MB. Free memory was 87.9MB in the beginning and 86.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:41:53,526 INFO L158 Benchmark]: Boogie Preprocessor took 40.26ms. Allocated memory is still 111.1MB. Free memory was 86.3MB in the beginning and 85.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:41:53,527 INFO L158 Benchmark]: RCFGBuilder took 392.00ms. Allocated memory is still 111.1MB. Free memory was 85.2MB in the beginning and 76.5MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:41:53,527 INFO L158 Benchmark]: TraceAbstraction took 397.99ms. Allocated memory is still 111.1MB. Free memory was 75.7MB in the beginning and 62.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:41:53,528 INFO L158 Benchmark]: Witness Printer took 5.67ms. Allocated memory is still 111.1MB. Free memory was 62.5MB in the beginning and 62.2MB in the end (delta: 262.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:41:53,550 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.58ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.9MB in the beginning and 87.9MB in the end (delta: -35.0MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 111.1MB. Free memory was 87.9MB in the beginning and 86.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.26ms. Allocated memory is still 111.1MB. Free memory was 86.3MB in the beginning and 85.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 392.00ms. Allocated memory is still 111.1MB. Free memory was 85.2MB in the beginning and 76.5MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 397.99ms. Allocated memory is still 111.1MB. Free memory was 75.7MB in the beginning and 62.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 5.67ms. Allocated memory is still 111.1MB. Free memory was 62.5MB in the beginning and 62.2MB in the end (delta: 262.2kB). 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: 4]: 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 20, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) VAL [x=1, y=10000000, z=42] [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 20:41:53,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:41:56,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:41:56,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:41:56,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:41:56,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:41:56,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:41:56,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:41:56,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:41:56,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:41:56,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:41:56,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:41:56,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:41:56,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:41:56,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:41:56,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:41:56,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:41:56,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:41:56,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:41:56,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:41:56,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:41:56,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:41:56,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:41:56,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:41:56,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:41:56,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:41:56,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:41:56,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:41:56,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:41:56,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:41:56,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:41:56,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:41:56,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:41:56,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:41:56,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:41:56,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:41:56,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:41:56,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:41:56,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:41:56,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:41:56,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:41:56,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:41:56,398 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-18 20:41:56,424 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:41:56,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:41:56,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:41:56,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:41:56,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:41:56,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:41:56,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:41:56,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:41:56,428 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:41:56,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:41:56,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:41:56,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:41:56,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:41:56,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:41:56,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:41:56,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:41:56,430 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:41:56,430 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:41:56,431 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:41:56,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:41:56,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:41:56,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:41:56,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:41:56,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:41:56,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:41:56,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:41:56,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:41:56,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:41:56,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:41:56,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:41:56,434 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:41:56,435 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:41:56,435 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:41:56,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:41:56,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:41:56,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:41:56,436 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_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-11-18 20:41:56,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:41:56,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:41:56,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:41:56,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:41:56,937 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:41:56,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-11-18 20:41:57,008 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data/e1bd0b624/ba8f2a63533f45b0806b4a3840449f3e/FLAG3869edf84 [2022-11-18 20:41:57,565 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:41:57,566 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/sv-benchmarks/c/float-benchs/loop-1.c [2022-11-18 20:41:57,573 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data/e1bd0b624/ba8f2a63533f45b0806b4a3840449f3e/FLAG3869edf84 [2022-11-18 20:41:58,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/data/e1bd0b624/ba8f2a63533f45b0806b4a3840449f3e [2022-11-18 20:41:58,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:41:58,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:41:58,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:41:58,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:41:58,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:41:58,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbce9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58, skipping insertion in model container [2022-11-18 20:41:58,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:41:58,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:41:58,271 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-18 20:41:58,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:41:58,308 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:41:58,340 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-18 20:41:58,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:41:58,368 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:41:58,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58 WrapperNode [2022-11-18 20:41:58,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:41:58,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:41:58,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:41:58,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:41:58,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,407 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-11-18 20:41:58,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:41:58,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:41:58,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:41:58,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:41:58,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:41:58,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:41:58,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:41:58,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:41:58,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (1/1) ... [2022-11-18 20:41:58,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:41:58,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:41:58,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:41:58,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:41:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:41:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:41:58,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:41:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:41:58,602 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:41:58,605 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:41:59,392 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:41:59,398 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:41:59,399 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:41:59,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:41:59 BoogieIcfgContainer [2022-11-18 20:41:59,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:41:59,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:41:59,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:41:59,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:41:59,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:41:58" (1/3) ... [2022-11-18 20:41:59,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2e3875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:41:59, skipping insertion in model container [2022-11-18 20:41:59,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:41:58" (2/3) ... [2022-11-18 20:41:59,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2e3875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:41:59, skipping insertion in model container [2022-11-18 20:41:59,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:41:59" (3/3) ... [2022-11-18 20:41:59,411 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-11-18 20:41:59,433 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:41:59,433 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:41:59,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:41:59,495 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;@65085dc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:41:59,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:41:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:41:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:41:59,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:41:59,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:41:59,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:41:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:41:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-18 20:41:59,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:41:59,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133142565] [2022-11-18 20:41:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:41:59,532 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-18 20:41:59,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:41:59,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:41:59,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:41:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:41:59,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:41:59,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:41:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:41:59,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:41:59,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:41:59,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133142565] [2022-11-18 20:41:59,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133142565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:41:59,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:41:59,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:41:59,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467356411] [2022-11-18 20:41:59,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:41:59,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:41:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:41:59,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:41:59,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:41:59,849 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:41:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:41:59,871 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-11-18 20:41:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:41:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-18 20:41:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:41:59,883 INFO L225 Difference]: With dead ends: 20 [2022-11-18 20:41:59,883 INFO L226 Difference]: Without dead ends: 8 [2022-11-18 20:41:59,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-18 20:41:59,892 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:41:59,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-11-18 20:41:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-18 20:41:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-18 20:41:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:41:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-11-18 20:41:59,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-11-18 20:41:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:41:59,940 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-11-18 20:41:59,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:41:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-11-18 20:41:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 20:41:59,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:41:59,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:41:59,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:42:00,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:42:00,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:42:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-11-18 20:42:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:42:00,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290441437] [2022-11-18 20:42:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:00,160 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-18 20:42:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:42:00,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:42:00,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:42:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:00,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:42:00,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:00,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:42:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:04,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:42:04,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290441437] [2022-11-18 20:42:04,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290441437] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:42:04,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:42:04,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-11-18 20:42:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491306613] [2022-11-18 20:42:04,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:42:04,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:42:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:42:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:42:04,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2022-11-18 20:42:04,789 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:42:12,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:42:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:14,426 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-18 20:42:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:42:14,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-18 20:42:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:14,433 INFO L225 Difference]: With dead ends: 15 [2022-11-18 20:42:14,433 INFO L226 Difference]: Without dead ends: 11 [2022-11-18 20:42:14,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2022-11-18 20:42:14,435 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:14,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-11-18 20:42:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-18 20:42:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-18 20:42:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:42:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-18 20:42:14,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-11-18 20:42:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:14,443 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-18 20:42:14,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:42:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-18 20:42:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:42:14,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:14,444 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:14,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:42:14,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:42:14,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:42:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-11-18 20:42:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:42:14,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874413291] [2022-11-18 20:42:14,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:42:14,658 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-18 20:42:14,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:42:14,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:42:14,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:42:15,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:42:15,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:42:15,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:42:15,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:19,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:42:51,516 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) is different from true [2022-11-18 20:42:57,621 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2022-11-18 20:42:59,663 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2022-11-18 20:42:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-18 20:42:59,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:42:59,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874413291] [2022-11-18 20:42:59,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874413291] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:42:59,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:42:59,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-11-18 20:42:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177861366] [2022-11-18 20:42:59,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:42:59,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:42:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:42:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:42:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=69, Unknown=7, NotChecked=38, Total=156 [2022-11-18 20:42:59,679 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:43:03,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:05,177 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:43:33,435 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:43:35,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:43,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:45,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:49,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:52,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:54,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:54,680 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-11-18 20:43:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:43:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 20:43:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:54,695 INFO L225 Difference]: With dead ends: 19 [2022-11-18 20:43:54,696 INFO L226 Difference]: Without dead ends: 15 [2022-11-18 20:43:54,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 69.6s TimeCoverageRelationStatistics Valid=84, Invalid=130, Unknown=8, NotChecked=84, Total=306 [2022-11-18 20:43:54,698 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:54,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 4 Unknown, 22 Unchecked, 19.0s Time] [2022-11-18 20:43:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-18 20:43:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-18 20:43:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:43:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-18 20:43:54,704 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-11-18 20:43:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:54,704 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-18 20:43:54,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:43:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-18 20:43:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:43:54,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:54,705 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2022-11-18 20:43:54,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:54,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:43:54,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:43:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:54,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1620705621, now seen corresponding path program 3 times [2022-11-18 20:43:54,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:43:54,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563111523] [2022-11-18 20:43:54,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:43:54,908 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-18 20:43:54,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:43:54,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:43:54,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:43:55,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:43:55,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:43:55,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:43:55,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:44:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:44:28,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:45:02,953 WARN L233 SmtUtils]: Spent 9.62s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:45:19,689 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from false [2022-11-18 20:45:21,719 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-11-18 20:45:40,259 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from false [2022-11-18 20:45:42,298 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from true [2022-11-18 20:46:00,916 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-18 20:46:02,963 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-18 20:46:21,695 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-18 20:46:23,749 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-18 20:46:42,579 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-18 20:46:44,641 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-18 20:47:03,664 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from false [2022-11-18 20:47:05,734 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from true [2022-11-18 20:47:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-11-18 20:47:05,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:47:05,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563111523] [2022-11-18 20:47:05,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563111523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:47:05,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:47:05,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-18 20:47:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998752501] [2022-11-18 20:47:05,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:47:05,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:47:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:47:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:47:05,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=140, Unknown=20, NotChecked=186, Total=420 [2022-11-18 20:47:05,760 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:07,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:47:09,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:47:11,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:47:12,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:47:14,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:47:17,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:47:20,326 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-18 20:47:22,396 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:47:24,467 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)))))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse4 .cse4)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:47:27,819 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:47:29,860 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))))) is different from false [2022-11-18 20:47:31,904 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))))) is different from true [2022-11-18 20:47:33,960 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse5) .cse5) .cse5) .cse5) |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse5) .cse5) .cse5) .cse5)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:47:45,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:48:19,027 WARN L233 SmtUtils]: Spent 18.17s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:48:21,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:48:33,619 WARN L233 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 14 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:48:35,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:48:37,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:49:21,278 WARN L233 SmtUtils]: Spent 29.14s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:49:23,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:49:25,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:49:26,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:49:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:26,591 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-11-18 20:49:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:49:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 20:49:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:26,620 INFO L225 Difference]: With dead ends: 23 [2022-11-18 20:49:26,621 INFO L226 Difference]: Without dead ends: 19 [2022-11-18 20:49:26,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 196.3s TimeCoverageRelationStatistics Valid=151, Invalid=246, Unknown=27, NotChecked=506, Total=930 [2022-11-18 20:49:26,623 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:26,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 21 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 8 Unknown, 70 Unchecked, 27.9s Time] [2022-11-18 20:49:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-18 20:49:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-18 20:49:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-11-18 20:49:26,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2022-11-18 20:49:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:26,634 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-11-18 20:49:26,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-11-18 20:49:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:49:26,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:26,636 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2022-11-18 20:49:26,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:26,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:49:26,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:49:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1499312107, now seen corresponding path program 4 times [2022-11-18 20:49:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:49:26,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075239926] [2022-11-18 20:49:26,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:49:26,860 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-18 20:49:26,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:49:26,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:49:26,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c707dc-947c-4302-965d-12355ed87d83/bin/uautomizer-TMbwUNV5ro/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-18 20:49:28,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:49:28,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:49:28,624 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:49:28,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:51:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:07,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:51:24,180 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse1))) (or (fp.lt (fp.add c_currentRoundingMode .cse0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1)) (not (fp.lt .cse0 .cse2)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from true [2022-11-18 20:51:43,906 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-11-18 20:52:06,600 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from false [2022-11-18 20:52:08,649 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from true [2022-11-18 20:52:35,599 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) is different from false [2022-11-18 20:52:37,657 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) is different from true [2022-11-18 20:53:08,918 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse9 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse10 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse9 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse6 .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) is different from false [2022-11-18 20:53:10,990 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse9 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse10 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse9 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse6 .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) is different from true [2022-11-18 20:53:46,663 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) is different from false [2022-11-18 20:53:48,730 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) is different from true [2022-11-18 20:54:28,864 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse9)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse9))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse5 .cse9)) (.cse2 (fp.add c_currentRoundingMode .cse4 .cse9))) (let ((.cse13 (fp.add c_currentRoundingMode .cse2 .cse9)) (.cse14 (fp.sub c_currentRoundingMode .cse3 .cse9))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse14 .cse9)) (.cse6 (fp.add c_currentRoundingMode .cse13 .cse9))) (let ((.cse11 (fp.add c_currentRoundingMode .cse6 .cse9)) (.cse12 (fp.sub c_currentRoundingMode .cse7 .cse9))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse12 .cse9)) (.cse0 (fp.add c_currentRoundingMode .cse11 .cse9))) (let ((.cse8 (fp.add c_currentRoundingMode .cse0 .cse9)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse9))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse8 .cse9) (fp.sub c_currentRoundingMode .cse10 .cse9)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse8 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) is different from false [2022-11-18 20:54:30,947 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse9)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse9))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse5 .cse9)) (.cse2 (fp.add c_currentRoundingMode .cse4 .cse9))) (let ((.cse13 (fp.add c_currentRoundingMode .cse2 .cse9)) (.cse14 (fp.sub c_currentRoundingMode .cse3 .cse9))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse14 .cse9)) (.cse6 (fp.add c_currentRoundingMode .cse13 .cse9))) (let ((.cse11 (fp.add c_currentRoundingMode .cse6 .cse9)) (.cse12 (fp.sub c_currentRoundingMode .cse7 .cse9))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse12 .cse9)) (.cse0 (fp.add c_currentRoundingMode .cse11 .cse9))) (let ((.cse8 (fp.add c_currentRoundingMode .cse0 .cse9)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse9))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse8 .cse9) (fp.sub c_currentRoundingMode .cse10 .cse9)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse8 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) is different from true [2022-11-18 20:55:15,556 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) is different from false [2022-11-18 20:55:17,645 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) is different from true [2022-11-18 20:56:06,714 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse10)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse10))) (let ((.cse17 (fp.add c_currentRoundingMode .cse4 .cse10)) (.cse18 (fp.sub c_currentRoundingMode .cse5 .cse10))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse18 .cse10)) (.cse8 (fp.add c_currentRoundingMode .cse17 .cse10))) (let ((.cse11 (fp.add c_currentRoundingMode .cse8 .cse10)) (.cse12 (fp.sub c_currentRoundingMode .cse9 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse12 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse11 .cse10))) (let ((.cse15 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse16 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse10)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse13 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse14 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse10) (fp.sub c_currentRoundingMode .cse1 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) is different from false [2022-11-18 20:56:08,804 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse10)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse10))) (let ((.cse17 (fp.add c_currentRoundingMode .cse4 .cse10)) (.cse18 (fp.sub c_currentRoundingMode .cse5 .cse10))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse18 .cse10)) (.cse8 (fp.add c_currentRoundingMode .cse17 .cse10))) (let ((.cse11 (fp.add c_currentRoundingMode .cse8 .cse10)) (.cse12 (fp.sub c_currentRoundingMode .cse9 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse12 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse11 .cse10))) (let ((.cse15 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse16 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse10)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse13 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse14 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse10) (fp.sub c_currentRoundingMode .cse1 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) is different from true [2022-11-18 20:57:02,573 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))))) is different from false [2022-11-18 20:57:04,665 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))))) is different from true