./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8 --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 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d --- 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-2329fc7 [2022-12-13 18:25:27,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:25:27,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:25:27,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:25:27,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:25:27,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:25:27,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:25:27,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:25:27,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:25:27,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:25:27,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:25:27,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:25:27,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:25:27,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:25:27,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:25:27,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:25:27,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:25:27,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:25:27,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:25:27,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:25:27,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:25:27,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:25:27,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:25:27,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:25:27,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:25:27,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:25:27,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:25:27,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:25:27,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:25:27,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:25:27,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:25:27,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:25:27,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:25:27,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:25:27,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:25:27,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:25:27,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:25:27,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:25:27,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:25:27,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:25:27,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:25:27,734 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:25:27,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:25:27,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:25:27,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:25:27,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:25:27,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:25:27,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:25:27,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:25:27,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:25:27,759 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:25:27,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:25:27,760 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:25:27,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:25:27,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:25:27,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:25:27,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:25:27,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:25:27,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:25:27,761 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:25:27,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:25:27,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:25:27,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:25:27,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:25:27,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:25:27,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:25:27,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:25:27,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:25:27,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:25:27,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:25:27,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:25:27,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:25:27,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:25:27,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:25:27,763 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:25:27,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:25:27,764 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:25:27,764 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8 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 -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2022-12-13 18:25:27,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:25:27,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:25:27,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:25:27,964 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:25:27,964 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:25:27,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-12-13 18:25:30,542 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:25:30,679 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:25:30,679 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-12-13 18:25:30,685 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/data/78f433979/bf9aec3f943c45a5b57e95438340cd97/FLAG0e27d3e4c [2022-12-13 18:25:30,699 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/data/78f433979/bf9aec3f943c45a5b57e95438340cd97 [2022-12-13 18:25:30,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:25:30,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:25:30,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:25:30,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:25:30,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:25:30,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8b6c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30, skipping insertion in model container [2022-12-13 18:25:30,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:25:30,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:25:30,852 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-12-13 18:25:30,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:25:30,865 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:25:30,874 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-12-13 18:25:30,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:25:30,884 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:25:30,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30 WrapperNode [2022-12-13 18:25:30,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:25:30,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:25:30,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:25:30,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:25:30,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,906 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-12-13 18:25:30,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:25:30,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:25:30,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:25:30,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:25:30,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,919 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:25:30,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:25:30,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:25:30,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:25:30,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (1/1) ... [2022-12-13 18:25:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:25:30,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:25:30,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:25:30,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:25:30,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:25:30,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:25:30,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:25:30,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:25:31,025 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:25:31,026 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:25:31,089 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:25:31,094 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:25:31,095 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 18:25:31,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:25:31 BoogieIcfgContainer [2022-12-13 18:25:31,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:25:31,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:25:31,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:25:31,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:25:31,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:25:30" (1/3) ... [2022-12-13 18:25:31,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17713575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:25:31, skipping insertion in model container [2022-12-13 18:25:31,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:30" (2/3) ... [2022-12-13 18:25:31,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17713575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:25:31, skipping insertion in model container [2022-12-13 18:25:31,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:25:31" (3/3) ... [2022-12-13 18:25:31,105 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2022-12-13 18:25:31,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:25:31,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 18:25:31,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:25:31,162 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;@33976a3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:25:31,163 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 18:25:31,166 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-12-13 18:25:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 18:25:31,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:25:31,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 18:25:31,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:25:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:25:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-12-13 18:25:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:25:31,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759059130] [2022-12-13 18:25:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:25:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:25:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:25:31,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:25:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:25:31,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:25:31,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:25:31,278 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 18:25:31,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:25:31,284 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-13 18:25:31,287 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:25:31,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:25:31 BoogieIcfgContainer [2022-12-13 18:25:31,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:25:31,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:25:31,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:25:31,300 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:25:31,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:25:31" (3/4) ... [2022-12-13 18:25:31,302 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 18:25:31,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:25:31,303 INFO L158 Benchmark]: Toolchain (without parser) took 600.29ms. Allocated memory is still 138.4MB. Free memory was 104.7MB in the beginning and 81.7MB in the end (delta: 23.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-12-13 18:25:31,303 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:25:31,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.57ms. Allocated memory is still 138.4MB. Free memory was 104.7MB in the beginning and 107.3MB in the end (delta: -2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 18:25:31,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.31ms. Allocated memory is still 138.4MB. Free memory was 107.3MB in the beginning and 105.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:25:31,305 INFO L158 Benchmark]: Boogie Preprocessor took 13.33ms. Allocated memory is still 138.4MB. Free memory was 105.8MB in the beginning and 104.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:25:31,306 INFO L158 Benchmark]: RCFGBuilder took 176.09ms. Allocated memory is still 138.4MB. Free memory was 104.7MB in the beginning and 95.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 18:25:31,306 INFO L158 Benchmark]: TraceAbstraction took 200.10ms. Allocated memory is still 138.4MB. Free memory was 95.3MB in the beginning and 82.2MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 18:25:31,307 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 138.4MB. Free memory was 82.2MB in the beginning and 81.7MB in the end (delta: 495.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:25:31,310 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.17ms. Allocated memory is still 138.4MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.57ms. Allocated memory is still 138.4MB. Free memory was 104.7MB in the beginning and 107.3MB in the end (delta: -2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.31ms. Allocated memory is still 138.4MB. Free memory was 107.3MB in the beginning and 105.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.33ms. Allocated memory is still 138.4MB. Free memory was 105.8MB in the beginning and 104.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 176.09ms. Allocated memory is still 138.4MB. Free memory was 104.7MB in the beginning and 95.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 200.10ms. Allocated memory is still 138.4MB. Free memory was 95.3MB in the beginning and 82.2MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 138.4MB. Free memory was 82.2MB in the beginning and 81.7MB in the end (delta: 495.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 29, overapproximation of someBinaryArithmeticFLOAToperation at line 21. Possible FailurePath: [L20] float x = 1.0f; [L21] float x1 = x/1.6f; VAL [x=1] [L23] COND FALSE !(x1 != x) VAL [x=1] [L29] CALL __VERIFIER_assert(x == 0) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, 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-12-13 18:25:31,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8 --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 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d --- 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-2329fc7 [2022-12-13 18:25:32,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:25:32,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:25:32,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:25:32,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:25:32,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:25:32,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:25:32,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:25:32,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:25:32,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:25:32,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:25:32,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:25:32,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:25:32,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:25:32,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:25:32,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:25:32,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:25:32,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:25:33,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:25:33,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:25:33,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:25:33,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:25:33,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:25:33,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:25:33,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:25:33,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:25:33,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:25:33,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:25:33,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:25:33,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:25:33,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:25:33,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:25:33,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:25:33,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:25:33,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:25:33,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:25:33,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:25:33,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:25:33,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:25:33,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:25:33,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:25:33,024 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 18:25:33,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:25:33,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:25:33,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:25:33,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:25:33,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:25:33,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:25:33,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:25:33,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:25:33,050 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:25:33,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:25:33,050 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:25:33,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:25:33,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:25:33,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:25:33,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:25:33,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:25:33,051 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:25:33,051 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 18:25:33,052 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 18:25:33,052 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:25:33,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:25:33,052 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:25:33,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:25:33,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:25:33,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:25:33,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:25:33,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:25:33,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:25:33,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:25:33,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:25:33,054 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 18:25:33,054 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 18:25:33,054 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:25:33,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:25:33,054 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:25:33,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:25:33,054 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 18:25:33,054 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:25:33,055 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8 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 -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2022-12-13 18:25:33,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:25:33,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:25:33,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:25:33,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:25:33,298 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:25:33,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-12-13 18:25:35,907 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:25:36,038 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:25:36,038 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-12-13 18:25:36,043 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/data/185da3ead/bef9bdaebda6461d963bb5324f68be3b/FLAG0e34da787 [2022-12-13 18:25:36,054 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/data/185da3ead/bef9bdaebda6461d963bb5324f68be3b [2022-12-13 18:25:36,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:25:36,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:25:36,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:25:36,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:25:36,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:25:36,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4087810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36, skipping insertion in model container [2022-12-13 18:25:36,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:25:36,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:25:36,195 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-12-13 18:25:36,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:25:36,215 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:25:36,225 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-12-13 18:25:36,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:25:36,241 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:25:36,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36 WrapperNode [2022-12-13 18:25:36,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:25:36,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:25:36,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:25:36,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:25:36,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,267 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-12-13 18:25:36,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:25:36,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:25:36,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:25:36,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:25:36,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,288 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:25:36,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:25:36,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:25:36,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:25:36,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (1/1) ... [2022-12-13 18:25:36,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:25:36,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:25:36,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:25:36,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:25:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:25:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 18:25:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:25:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:25:36,408 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:25:36,410 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:25:37,178 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:25:37,183 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:25:37,183 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 18:25:37,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:25:37 BoogieIcfgContainer [2022-12-13 18:25:37,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:25:37,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:25:37,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:25:37,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:25:37,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:25:36" (1/3) ... [2022-12-13 18:25:37,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d35efb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:25:37, skipping insertion in model container [2022-12-13 18:25:37,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:25:36" (2/3) ... [2022-12-13 18:25:37,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d35efb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:25:37, skipping insertion in model container [2022-12-13 18:25:37,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:25:37" (3/3) ... [2022-12-13 18:25:37,194 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2022-12-13 18:25:37,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:25:37,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 18:25:37,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:25:37,254 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;@54eb1676, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:25:37,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 18:25:37,257 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-12-13 18:25:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 18:25:37,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:25:37,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 18:25:37,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:25:37,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:25:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-12-13 18:25:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:25:37,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644778238] [2022-12-13 18:25:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:25:37,275 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-12-13 18:25:37,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:25:37,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:25:37,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:25:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:37,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:25:37,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:25:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:25:39,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:25:39,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:25:39,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644778238] [2022-12-13 18:25:39,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644778238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:25:39,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:25:39,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:25:39,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674081714] [2022-12-13 18:25:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:25:39,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:25:39,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:25:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:25:39,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:25:39,032 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 4 states, 4 states have (on average 1.5) 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-12-13 18:25:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:25:40,363 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-12-13 18:25:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:25:40,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-12-13 18:25:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:25:40,371 INFO L225 Difference]: With dead ends: 20 [2022-12-13 18:25:40,371 INFO L226 Difference]: Without dead ends: 8 [2022-12-13 18:25:40,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:25:40,377 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:25:40,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:25:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-12-13 18:25:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-12-13 18:25:40,401 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-12-13 18:25:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-12-13 18:25:40,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-12-13 18:25:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:25:40,403 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-12-13 18:25:40,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-12-13 18:25:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-12-13 18:25:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 18:25:40,403 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:25:40,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:25:40,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:25:40,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:25:40,606 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:25:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:25:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-12-13 18:25:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:25:40,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65247972] [2022-12-13 18:25:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:25:40,613 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-12-13 18:25:40,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:25:40,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:25:40,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:25:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:40,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:25:40,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:25:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:25:44,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:26:00,205 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:26:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:26:00,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:26:00,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65247972] [2022-12-13 18:26:00,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65247972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:26:00,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:26:00,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-12-13 18:26:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119228083] [2022-12-13 18:26:00,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:26:00,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:26:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:26:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:26:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2022-12-13 18:26:00,209 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.375) 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-12-13 18:26:12,658 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-12-13 18:26:15,983 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-12-13 18:26:17,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:26:20,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:26:22,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:26:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:26:22,330 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-12-13 18:26:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:26:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) 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-12-13 18:26:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:26:22,352 INFO L225 Difference]: With dead ends: 15 [2022-12-13 18:26:22,352 INFO L226 Difference]: Without dead ends: 11 [2022-12-13 18:26:22,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=43, Invalid=70, Unknown=1, NotChecked=18, Total=132 [2022-12-13 18:26:22,354 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-12-13 18:26:22,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 5 Unknown, 7 Unchecked, 11.9s Time] [2022-12-13 18:26:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-12-13 18:26:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-12-13 18:26:22,356 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-12-13 18:26:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-12-13 18:26:22,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-12-13 18:26:22,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:26:22,357 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-12-13 18:26:22,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) 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-12-13 18:26:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-12-13 18:26:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 18:26:22,357 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:26:22,357 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-12-13 18:26:22,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:26:22,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:26:22,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:26:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:26:22,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-12-13 18:26:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:26:22,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520622938] [2022-12-13 18:26:22,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:26:22,563 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-12-13 18:26:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:26:22,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:26:22,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:26:23,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:26:23,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:26:23,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 18:26:23,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:26:38,739 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:26:45,309 WARN L859 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-12-13 18:26:53,061 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:26:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-13 18:26:53,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:27:14,484 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:27:26,706 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-13 18:27:37,804 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-13 18:27:49,117 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-13 18:27:51,298 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-13 18:28:02,941 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-12-13 18:28:05,157 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-12-13 18:28:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-13 18:28:05,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:28:05,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520622938] [2022-12-13 18:28:05,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520622938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:28:05,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:28:05,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2022-12-13 18:28:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595926268] [2022-12-13 18:28:05,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:28:05,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 18:28:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:28:05,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 18:28:05,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=56, Unknown=11, NotChecked=140, Total=240 [2022-12-13 18:28:05,160 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-12-13 18:28:08,141 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:28:10,321 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:28:12,404 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 18:28:14,534 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:29:00,148 WARN L233 SmtUtils]: Spent 24.50s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:29:01,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:04,193 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse1)) (or (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from false [2022-12-13 18:29:29,420 WARN L233 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 23 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:29:30,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:32,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:35,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:36,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:39,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:41,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:42,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:44,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:29:44,535 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-12-13 18:29:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:29:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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) Word has length 10 [2022-12-13 18:29:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:29:44,565 INFO L225 Difference]: With dead ends: 16 [2022-12-13 18:29:44,565 INFO L226 Difference]: Without dead ends: 12 [2022-12-13 18:29:44,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 130.5s TimeCoverageRelationStatistics Valid=48, Invalid=78, Unknown=28, NotChecked=308, Total=462 [2022-12-13 18:29:44,566 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:29:44,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 13 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 5 Unknown, 58 Unchecked, 17.6s Time] [2022-12-13 18:29:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-13 18:29:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-13 18:29:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-12-13 18:29:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-12-13 18:29:44,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2022-12-13 18:29:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:29:44,569 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-12-13 18:29:44,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-12-13 18:29:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-12-13 18:29:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 18:29:44,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:29:44,570 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2022-12-13 18:29:44,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:29:44,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:29:44,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:29:44,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:29:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash 522938704, now seen corresponding path program 3 times [2022-12-13 18:29:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:29:44,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780463330] [2022-12-13 18:29:44,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:29:44,775 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-12-13 18:29:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:29:44,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:29:44,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:29:45,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 18:29:45,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:29:45,919 WARN L261 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 18:29:45,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:30:01,802 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:30:08,567 WARN L859 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-12-13 18:30:16,259 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:30:23,618 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:30:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-12-13 18:30:27,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:30:34,899 WARN L859 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-12-13 18:30:51,398 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-13 18:31:06,918 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-12-13 18:31:09,066 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-12-13 18:31:25,178 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from false [2022-12-13 18:31:27,381 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from true [2022-12-13 18:31:44,100 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from false [2022-12-13 18:31:46,366 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from true [2022-12-13 18:32:03,507 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-12-13 18:32:05,743 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-12-13 18:32:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-12-13 18:32:05,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:32:05,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780463330] [2022-12-13 18:32:05,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780463330] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:32:05,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:32:05,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2022-12-13 18:32:05,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015879707] [2022-12-13 18:32:05,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:32:05,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 18:32:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:32:05,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 18:32:05,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=46, Unknown=14, NotChecked=210, Total=306 [2022-12-13 18:32:05,746 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-12-13 18:32:08,031 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:32:10,310 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:32:12,526 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2)))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:32:14,698 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:32:16,956 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from false [2022-12-13 18:32:19,053 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2022-12-13 18:32:21,106 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 18:32:23,265 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:32:25,515 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (or (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:32:29,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:32:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:32:29,297 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-12-13 18:32:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:32:29,298 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 11 [2022-12-13 18:32:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:32:29,299 INFO L225 Difference]: With dead ends: 17 [2022-12-13 18:32:29,299 INFO L226 Difference]: Without dead ends: 13 [2022-12-13 18:32:29,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=50, Invalid=51, Unknown=23, NotChecked=476, Total=600 [2022-12-13 18:32:29,300 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:32:29,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 66 Unchecked, 3.8s Time] [2022-12-13 18:32:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-13 18:32:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-13 18:32:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-12-13 18:32:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-13 18:32:29,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-12-13 18:32:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:32:29,305 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-13 18:32:29,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-12-13 18:32:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-13 18:32:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 18:32:29,305 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:32:29,305 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2022-12-13 18:32:29,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:32:29,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:32:29,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:32:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:32:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash -967103989, now seen corresponding path program 4 times [2022-12-13 18:32:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:32:29,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931399705] [2022-12-13 18:32:29,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:32:29,507 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-12-13 18:32:29,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:32:29,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:32:29,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:32:30,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:32:30,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:32:30,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 18:32:30,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:32:47,742 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:32:54,555 WARN L859 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-12-13 18:33:16,399 WARN L233 SmtUtils]: Spent 7.17s 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-12-13 18:33:23,875 WARN L859 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:33:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 15 not checked. [2022-12-13 18:33:28,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:33:48,818 WARN L837 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-12-13 18:33:50,924 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:33:57,410 WARN L837 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-12-13 18:33:59,572 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:34:06,267 WARN L837 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-12-13 18:34:08,495 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:34:15,352 WARN L837 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-12-13 18:34:17,641 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:34:24,647 WARN L837 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-12-13 18:34:26,987 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:34:34,145 WARN L837 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-12-13 18:34:36,514 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:34:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-12-13 18:34:36,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:34:36,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931399705] [2022-12-13 18:34:36,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931399705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:34:36,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:34:36,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-12-13 18:34:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977555678] [2022-12-13 18:34:36,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:34:36,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 18:34:36,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:34:36,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 18:34:36,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=48, Unknown=21, NotChecked=198, Total=306 [2022-12-13 18:34:36,516 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-12-13 18:34:39,074 WARN L859 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:34:41,429 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:34:43,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 18:34:45,884 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:34:48,130 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:34:50,461 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from false [2022-12-13 18:34:52,632 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2022-12-13 18:34:56,168 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:34:59,153 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:35:01,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:03,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:05,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:15,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:17,294 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-12-13 18:35:19,334 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-12-13 18:35:21,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:24,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:25,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:28,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:30,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:32,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:35:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:32,914 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-12-13 18:35:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:35:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 12 [2022-12-13 18:35:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:32,915 INFO L225 Difference]: With dead ends: 20 [2022-12-13 18:35:32,915 INFO L226 Difference]: Without dead ends: 16 [2022-12-13 18:35:32,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 103.9s TimeCoverageRelationStatistics Valid=58, Invalid=66, Unknown=30, NotChecked=496, Total=650 [2022-12-13 18:35:32,916 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:32,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 9 Unknown, 87 Unchecked, 26.3s Time] [2022-12-13 18:35:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-13 18:35:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-12-13 18:35:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-12-13 18:35:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-12-13 18:35:32,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-12-13 18:35:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:32,920 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-12-13 18:35:32,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-12-13 18:35:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-12-13 18:35:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 18:35:32,921 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:32,921 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:32,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-12-13 18:35:33,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:35:33,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:35:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1299398672, now seen corresponding path program 5 times [2022-12-13 18:35:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:35:33,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743725510] [2022-12-13 18:35:33,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 18:35:33,124 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-12-13 18:35:33,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:35:33,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:35:33,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 18:35:35,150 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 18:35:35,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:35:35,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 18:35:35,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:41,358 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:35:46,927 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:35:54,414 WARN L859 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-12-13 18:36:01,879 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:36:09,998 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:36:15,269 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:36:27,772 WARN L233 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:36:33,217 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:36:36,061 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:36:41,753 WARN L233 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:36:44,949 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:36:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 42 not checked. [2022-12-13 18:36:47,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:37:05,702 WARN L837 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-12-13 18:37:07,814 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:37:14,344 WARN L837 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-12-13 18:37:16,524 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-13 18:37:27,953 WARN L837 $PredicateComparison]: unable to prove that (or (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) is different from false [2022-12-13 18:37:30,186 WARN L859 $PredicateComparison]: unable to prove that (or (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) is different from true [2022-12-13 18:37:42,010 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (or (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse2) .cse2) .cse2))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)))))) is different from false [2022-12-13 18:37:44,299 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (or (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse2) .cse2) .cse2))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)))))) is different from true [2022-12-13 18:37:54,246 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:37:56,598 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2022-12-13 18:37:58,935 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from true [2022-12-13 18:38:04,252 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:38:11,685 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2022-12-13 18:38:14,118 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from true [2022-12-13 18:38:19,315 WARN L233 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:38:24,788 WARN L233 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:38:27,262 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2022-12-13 18:38:29,724 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from true [2022-12-13 18:38:35,084 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:38:40,769 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:38:43,322 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse1))) (or (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (fp.eq .cse2 .cse3))))) is different from false [2022-12-13 18:38:45,852 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse1))) (or (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (fp.eq .cse2 .cse3))))) is different from true [2022-12-13 18:38:51,705 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:38:57,234 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 18:38:59,808 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2022-12-13 18:39:02,364 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from true [2022-12-13 18:39:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 44 not checked. [2022-12-13 18:39:02,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:39:02,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743725510] [2022-12-13 18:39:02,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743725510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:39:02,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:39:02,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2022-12-13 18:39:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559931065] [2022-12-13 18:39:02,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:39:02,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 18:39:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:39:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 18:39:02,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=42, Unknown=29, NotChecked=432, Total=552 [2022-12-13 18:39:02,367 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-12-13 18:39:05,111 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:39:07,423 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0)) (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse0))) (or (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (fp.eq .cse2 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 18:39:09,934 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0)) (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse0))) (or (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (fp.eq .cse2 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:39:12,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 .cse2) (not (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse3 .cse0) .cse3)))))))) is different from false [2022-12-13 18:39:14,795 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 .cse2) (not (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse3 .cse0) .cse3)))))))) is different from true [2022-12-13 18:39:17,571 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2)))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3) .cse3)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:39:19,949 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 .cse2) (not (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse3 .cse0) .cse3)))))))) is different from true [2022-12-13 18:39:22,136 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (fp.eq .cse1 |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse0) .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 18:39:24,438 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (fp.eq .cse1 |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse0) .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:39:26,580 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (or (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 18:39:28,814 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (or (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:39:31,040 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:39:33,164 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 18:40:04,131 WARN L233 SmtUtils]: Spent 16.87s on a formula simplification. DAG size of input: 22 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:40:05,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:40:21,829 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:40:23,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:40:26,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:40:28,719 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-12-13 18:40:31,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 18:40:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:40:31,929 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-12-13 18:40:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:40:31,930 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 15 [2022-12-13 18:40:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:40:31,931 INFO L225 Difference]: With dead ends: 23 [2022-12-13 18:40:31,931 INFO L226 Difference]: Without dead ends: 19 [2022-12-13 18:40:31,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 163.0s TimeCoverageRelationStatistics Valid=89, Invalid=95, Unknown=48, NotChecked=1100, Total=1332 [2022-12-13 18:40:31,933 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:40:31,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 16 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 4 Unknown, 168 Unchecked, 13.1s Time] [2022-12-13 18:40:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-13 18:40:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-12-13 18:40:31,937 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-12-13 18:40:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-12-13 18:40:31,938 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2022-12-13 18:40:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:40:31,938 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-12-13 18:40:31,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-12-13 18:40:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-12-13 18:40:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 18:40:31,939 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:40:31,939 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:31,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 18:40:32,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:40:32,141 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:40:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1499312107, now seen corresponding path program 6 times [2022-12-13 18:40:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:40:32,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747662868] [2022-12-13 18:40:32,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 18:40:32,143 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-12-13 18:40:32,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:40:32,146 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/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-12-13 18:40:32,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd9fa5a-3b19-46a7-a7a3-8d5454e93698/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 18:40:34,633 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-12-13 18:40:34,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:40:34,731 WARN L261 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 18:40:34,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:40:41,034 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 18:40:57,038 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)