./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 8393723b 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_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/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_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-8393723 [2022-11-18 20:33:21,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:33:21,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:33:21,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:33:21,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:33:21,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:33:21,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:33:21,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:33:21,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:33:21,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:33:21,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:33:21,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:33:21,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:33:21,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:33:21,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:33:21,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:33:21,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:33:21,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:33:21,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:33:21,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:33:21,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:33:21,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:33:21,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:33:21,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:33:21,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:33:21,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:33:21,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:33:21,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:33:21,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:33:21,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:33:21,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:33:21,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:33:21,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:33:21,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:33:21,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:33:21,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:33:21,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:33:21,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:33:21,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:33:21,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:33:21,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:33:21,924 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:33:21,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:33:21,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:33:21,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:33:21,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:33:21,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:33:21,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:33:21,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:33:21,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:33:21,965 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:33:21,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:33:21,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:33:21,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:33:21,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:33:21,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:33:21,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:33:21,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:33:21,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:33:21,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:33:21,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:33:21,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:33:21,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:33:21,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:33:21,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:33:21,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:33:21,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:33:21,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:33:21,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:33:21,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:33:21,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:33:21,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:33:21,973 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:33:21,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:33:21,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:33:21,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2022-11-18 20:33:22,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:33:22,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:33:22,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:33:22,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:33:22,333 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:33:22,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-11-18 20:33:22,425 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data/a17bfda0c/ccc8394c713f4e5a8bc4a09a2799102d/FLAGe7ff2d052 [2022-11-18 20:33:22,896 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:33:22,897 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-11-18 20:33:22,903 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data/a17bfda0c/ccc8394c713f4e5a8bc4a09a2799102d/FLAGe7ff2d052 [2022-11-18 20:33:23,294 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data/a17bfda0c/ccc8394c713f4e5a8bc4a09a2799102d [2022-11-18 20:33:23,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:33:23,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:33:23,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:33:23,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:33:23,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:33:23,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b813609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23, skipping insertion in model container [2022-11-18 20:33:23,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:33:23,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:33:23,616 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-11-18 20:33:23,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:33:23,645 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:33:23,660 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-11-18 20:33:23,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:33:23,681 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:33:23,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23 WrapperNode [2022-11-18 20:33:23,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:33:23,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:33:23,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:33:23,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:33:23,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,720 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-11-18 20:33:23,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:33:23,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:33:23,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:33:23,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:33:23,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,752 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:33:23,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:33:23,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:33:23,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:33:23,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (1/1) ... [2022-11-18 20:33:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:33:23,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:23,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:33:23,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:33:23,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:33:23,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:33:23,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:33:23,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:33:23,913 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:33:23,915 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:33:24,006 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:33:24,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:33:24,013 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:33:24,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:33:24 BoogieIcfgContainer [2022-11-18 20:33:24,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:33:24,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:33:24,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:33:24,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:33:24,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:33:23" (1/3) ... [2022-11-18 20:33:24,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7433a0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:33:24, skipping insertion in model container [2022-11-18 20:33:24,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:23" (2/3) ... [2022-11-18 20:33:24,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7433a0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:33:24, skipping insertion in model container [2022-11-18 20:33:24,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:33:24" (3/3) ... [2022-11-18 20:33:24,031 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2022-11-18 20:33:24,056 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:33:24,056 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:33:24,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:33:24,127 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;@37b4394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:33:24,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:33:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:33:24,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:24,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:33:24,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:24,149 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-18 20:33:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:24,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451184012] [2022-11-18 20:33:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:33:24,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:33:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:33:24,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:33:24,300 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:33:24,302 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:33:24,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:33:24,309 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-18 20:33:24,314 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:33:24,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:33:24 BoogieIcfgContainer [2022-11-18 20:33:24,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:33:24,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:33:24,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:33:24,336 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:33:24,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:33:24" (3/4) ... [2022-11-18 20:33:24,340 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:33:24,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:33:24,342 INFO L158 Benchmark]: Toolchain (without parser) took 1040.53ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 78.3MB in the end (delta: 14.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-11-18 20:33:24,343 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 26.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:33:24,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.66ms. Allocated memory is still 127.9MB. Free memory was 92.4MB in the beginning and 103.7MB in the end (delta: -11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:33:24,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.77ms. Allocated memory is still 127.9MB. Free memory was 103.7MB in the beginning and 102.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:33:24,347 INFO L158 Benchmark]: Boogie Preprocessor took 33.91ms. Allocated memory is still 127.9MB. Free memory was 102.3MB in the beginning and 101.4MB in the end (delta: 899.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:33:24,352 INFO L158 Benchmark]: RCFGBuilder took 259.05ms. Allocated memory is still 127.9MB. Free memory was 101.4MB in the beginning and 91.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:33:24,353 INFO L158 Benchmark]: TraceAbstraction took 317.01ms. Allocated memory is still 127.9MB. Free memory was 91.2MB in the beginning and 78.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:33:24,355 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 127.9MB. Free memory was 78.6MB in the beginning and 78.3MB in the end (delta: 287.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:33:24,365 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 26.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.66ms. Allocated memory is still 127.9MB. Free memory was 92.4MB in the beginning and 103.7MB in the end (delta: -11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.77ms. Allocated memory is still 127.9MB. Free memory was 103.7MB in the beginning and 102.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.91ms. Allocated memory is still 127.9MB. Free memory was 102.3MB in the beginning and 101.4MB in the end (delta: 899.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 259.05ms. Allocated memory is still 127.9MB. Free memory was 101.4MB in the beginning and 91.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 317.01ms. Allocated memory is still 127.9MB. Free memory was 91.2MB in the beginning and 78.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 127.9MB. Free memory was 78.6MB in the beginning and 78.3MB in the end (delta: 287.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.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 20:33:24,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/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_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/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_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-8393723 [2022-11-18 20:33:26,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:33:26,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:33:26,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:33:26,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:33:26,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:33:26,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:33:26,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:33:26,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:33:26,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:33:26,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:33:26,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:33:26,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:33:26,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:33:26,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:33:26,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:33:26,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:33:26,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:33:26,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:33:26,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:33:26,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:33:26,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:33:26,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:33:26,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:33:26,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:33:26,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:33:26,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:33:26,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:33:26,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:33:26,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:33:26,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:33:26,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:33:26,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:33:26,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:33:26,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:33:26,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:33:26,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:33:26,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:33:26,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:33:26,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:33:26,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:33:26,837 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-18 20:33:26,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:33:26,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:33:26,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:33:26,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:33:26,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:33:26,881 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:33:26,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:33:26,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:33:26,883 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:33:26,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:33:26,885 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:33:26,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:33:26,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:33:26,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:33:26,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:33:26,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:33:26,887 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:33:26,887 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:33:26,887 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:33:26,887 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:33:26,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:33:26,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:33:26,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:33:26,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:33:26,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:33:26,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:33:26,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:33:26,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:33:26,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:33:26,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:33:26,890 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:33:26,891 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:33:26,891 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:33:26,891 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:33:26,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:33:26,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:33:26,892 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2022-11-18 20:33:27,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:33:27,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:33:27,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:33:27,351 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:33:27,352 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:33:27,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-11-18 20:33:27,439 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data/c13e47b0d/647cd7e71703442a937166c2a9f4c0ce/FLAG382047ff7 [2022-11-18 20:33:27,955 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:33:27,956 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-11-18 20:33:27,965 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data/c13e47b0d/647cd7e71703442a937166c2a9f4c0ce/FLAG382047ff7 [2022-11-18 20:33:28,324 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/data/c13e47b0d/647cd7e71703442a937166c2a9f4c0ce [2022-11-18 20:33:28,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:33:28,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:33:28,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:33:28,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:33:28,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:33:28,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e07d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28, skipping insertion in model container [2022-11-18 20:33:28,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:33:28,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:33:28,503 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-11-18 20:33:28,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:33:28,529 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:33:28,572 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-11-18 20:33:28,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:33:28,604 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:33:28,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28 WrapperNode [2022-11-18 20:33:28,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:33:28,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:33:28,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:33:28,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:33:28,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,640 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-11-18 20:33:28,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:33:28,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:33:28,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:33:28,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:33:28,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,666 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:33:28,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:33:28,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:33:28,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:33:28,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (1/1) ... [2022-11-18 20:33:28,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:33:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:28,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:33:28,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:33:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:33:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:33:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:33:28,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:33:28,844 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:33:28,847 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:33:29,810 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:33:29,817 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:33:29,817 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:33:29,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:33:29 BoogieIcfgContainer [2022-11-18 20:33:29,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:33:29,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:33:29,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:33:29,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:33:29,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:33:28" (1/3) ... [2022-11-18 20:33:29,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b10f666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:33:29, skipping insertion in model container [2022-11-18 20:33:29,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:28" (2/3) ... [2022-11-18 20:33:29,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b10f666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:33:29, skipping insertion in model container [2022-11-18 20:33:29,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:33:29" (3/3) ... [2022-11-18 20:33:29,829 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2022-11-18 20:33:29,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:33:29,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:33:29,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:33:29,916 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;@75736ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:33:29,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:33:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:33:29,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:29,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:33:29,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-18 20:33:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:33:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132756450] [2022-11-18 20:33:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:29,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:33:29,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:33:29,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:33:29,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 20:33:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:30,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:33:30,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:32,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:33:32,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:33:32,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132756450] [2022-11-18 20:33:32,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132756450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:33:32,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:33:32,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:33:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699478686] [2022-11-18 20:33:32,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:33:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:33:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:33:32,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:33:32,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:33:32,559 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-11-18 20:33:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:34,447 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-11-18 20:33:34,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:33:34,450 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-11-18 20:33:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:34,467 INFO L225 Difference]: With dead ends: 20 [2022-11-18 20:33:34,467 INFO L226 Difference]: Without dead ends: 8 [2022-11-18 20:33:34,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:33:34,484 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:34,488 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.5s Time] [2022-11-18 20:33:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-18 20:33:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-18 20:33:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-11-18 20:33:34,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-11-18 20:33:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:34,523 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-11-18 20:33:34,524 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-11-18 20:33:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-11-18 20:33:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 20:33:34,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:34,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:34,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-18 20:33:34,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:33:34,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:34,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-11-18 20:33:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:33:34,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896472758] [2022-11-18 20:33:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:34,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:33:34,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:33:34,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:33:34,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 20:33:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:35,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:33:35,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:39,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:56,446 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 ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-18 20:33:58,518 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-11-18 20:33:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:58,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:33:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896472758] [2022-11-18 20:33:58,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896472758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:33:58,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:33:58,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-11-18 20:33:58,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829957001] [2022-11-18 20:33:58,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:33:58,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:33:58,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:33:58,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:33:58,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2022-11-18 20:33:58,524 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-11-18 20:34:00,749 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 ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-18 20:34:13,290 WARN L233 SmtUtils]: Spent 5.07s 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-11-18 20:34:15,367 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-11-18 20:34:17,849 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-11-18 20:34:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:18,415 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-18 20:34:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:34:18,441 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-11-18 20:34:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:18,442 INFO L225 Difference]: With dead ends: 15 [2022-11-18 20:34:18,442 INFO L226 Difference]: Without dead ends: 11 [2022-11-18 20:34:18,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=37, Invalid=58, Unknown=3, NotChecked=34, Total=132 [2022-11-18 20:34:18,444 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:18,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 2 Unknown, 8 Unchecked, 8.1s Time] [2022-11-18 20:34:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-18 20:34:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-18 20:34:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-18 20:34:18,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-11-18 20:34:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:18,451 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-18 20:34:18,451 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-11-18 20:34:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-18 20:34:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:34:18,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:18,452 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:18,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:18,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:34:18,659 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-11-18 20:34:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:18,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258647375] [2022-11-18 20:34:18,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:34:18,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:34:18,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:18,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:34:18,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 20:34:19,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:34:19,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:34:19,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 20:34:19,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:25,681 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-11-18 20:34:40,876 WARN L233 SmtUtils]: Spent 6.52s 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-11-18 20:34:47,536 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-11-18 20:34:55,502 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-11-18 20:34:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-18 20:34:55,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:03,253 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| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-11-18 20:35:11,996 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 |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 false [2022-11-18 20:35:14,077 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-11-18 20:35:25,168 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 |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 false [2022-11-18 20:35:27,307 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-11-18 20:35:38,742 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-11-18 20:35:40,919 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-11-18 20:35:52,218 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-11-18 20:35:54,391 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-11-18 20:35:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-18 20:35:54,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:35:54,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258647375] [2022-11-18 20:35:54,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258647375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:54,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:54,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2022-11-18 20:35:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363523443] [2022-11-18 20:35:54,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:54,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:35:54,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:35:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:35:54,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=42, Unknown=14, NotChecked=152, Total=240 [2022-11-18 20:35:54,396 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-11-18 20:35:56,609 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-11-18 20:35:58,817 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-11-18 20:36:00,900 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-11-18 20:36:03,039 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-11-18 20:36:41,325 WARN L233 SmtUtils]: Spent 24.41s 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-11-18 20:36:42,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:36:44,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:36:46,919 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-11-18 20:36:49,288 WARN L859 $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 true [2022-11-18 20:37:16,072 WARN L233 SmtUtils]: Spent 16.34s 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-11-18 20:37:18,865 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-11-18 20:37:21,978 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-11-18 20:37:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:22,061 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-18 20:37:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:37:22,062 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-11-18 20:37:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:22,063 INFO L225 Difference]: With dead ends: 16 [2022-11-18 20:37:22,063 INFO L226 Difference]: Without dead ends: 12 [2022-11-18 20:37:22,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 117.7s TimeCoverageRelationStatistics Valid=48, Invalid=63, Unknown=27, NotChecked=324, Total=462 [2022-11-18 20:37:22,066 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:22,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 13 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 2 Unknown, 59 Unchecked, 9.3s Time] [2022-11-18 20:37:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-18 20:37:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-18 20:37:22,071 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-11-18 20:37:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-18 20:37:22,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2022-11-18 20:37:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:22,073 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-18 20:37:22,073 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-11-18 20:37:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-18 20:37:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:37:22,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:22,075 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2022-11-18 20:37:22,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:22,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:22,277 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:22,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash 522938704, now seen corresponding path program 3 times [2022-11-18 20:37:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:22,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304645954] [2022-11-18 20:37:22,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:37:22,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:22,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:22,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:22,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 20:37:23,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-18 20:37:23,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:37:23,649 WARN L261 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:37:23,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:30,218 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-11-18 20:37:37,185 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-11-18 20:37:44,231 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-11-18 20:37:52,939 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-11-18 20:37:59,314 WARN L233 SmtUtils]: Spent 5.13s 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-11-18 20:38:13,454 WARN L233 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:38:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-18 20:38:16,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:38:51,481 WARN L233 SmtUtils]: Spent 10.83s 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-11-18 20:39:06,571 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 |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 false [2022-11-18 20:39:08,669 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-11-18 20:39:24,515 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-11-18 20:39:26,674 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-11-18 20:39:43,248 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-11-18 20:39:45,459 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-11-18 20:39:50,489 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:40:00,442 WARN L233 SmtUtils]: Spent 5.03s 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-11-18 20:40:02,725 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-11-18 20:40:05,002 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-11-18 20:40:10,124 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:40:15,321 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:40:20,530 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:40:22,851 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-11-18 20:40:25,174 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-11-18 20:40:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-18 20:40:25,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:40:25,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304645954] [2022-11-18 20:40:25,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304645954] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:40:25,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:40:25,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2022-11-18 20:40:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878170271] [2022-11-18 20:40:25,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:40:25,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:40:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:40:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:40:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=50, Unknown=21, NotChecked=198, Total=306 [2022-11-18 20:40:25,177 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-11-18 20:40:27,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:40:30,235 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-11-18 20:40:32,537 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-11-18 20:40:34,770 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-11-18 20:40:37,049 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-11-18 20:40:39,276 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-11-18 20:40:41,382 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-11-18 20:40:45,137 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-11-18 20:41:15,442 WARN L233 SmtUtils]: Spent 21.60s on a formula simplification. DAG size of input: 19 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:41:42,366 WARN L233 SmtUtils]: Spent 20.71s on a formula simplification. DAG size of input: 17 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:41:45,381 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-11-18 20:42:19,981 WARN L233 SmtUtils]: Spent 23.36s on a formula simplification. DAG size of input: 20 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:42:22,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:42:39,860 WARN L233 SmtUtils]: Spent 11.18s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:42:41,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:42:43,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:42:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:45,363 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-11-18 20:42:45,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:42:45,402 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-11-18 20:42:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:45,403 INFO L225 Difference]: With dead ends: 21 [2022-11-18 20:42:45,403 INFO L226 Difference]: Without dead ends: 15 [2022-11-18 20:42:45,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 198.0s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=32, NotChecked=570, Total=812 [2022-11-18 20:42:45,405 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:45,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 4 Unknown, 68 Unchecked, 17.2s Time] [2022-11-18 20:42:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-18 20:42:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-18 20:42:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:42:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-18 20:42:45,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2022-11-18 20:42:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:45,412 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-18 20:42:45,412 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-11-18 20:42:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-18 20:42:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:42:45,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:45,413 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:45,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:45,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:42:45,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:42:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1620705621, now seen corresponding path program 4 times [2022-11-18 20:42:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:42:45,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689518593] [2022-11-18 20:42:45,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:42:45,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:42:45,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:42:45,616 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:42:45,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 20:42:47,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:42:47,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:42:47,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:42:47,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:54,047 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-11-18 20:43:09,152 WARN L233 SmtUtils]: Spent 6.68s 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-11-18 20:43:16,181 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-11-18 20:43:23,900 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-11-18 20:43:29,190 WARN L233 SmtUtils]: Spent 5.25s 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-11-18 20:43:31,672 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-11-18 20:43:37,211 WARN L233 SmtUtils]: Spent 5.50s 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-11-18 20:43:40,082 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 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-18 20:43:45,963 WARN L233 SmtUtils]: Spent 5.85s 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-11-18 20:43:49,206 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-11-18 20:43:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 33 not checked. [2022-11-18 20:43:54,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:44:17,215 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-11-18 20:44:19,330 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-11-18 20:44:25,842 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-11-18 20:44:28,012 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-11-18 20:44:34,716 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-11-18 20:44:36,953 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-11-18 20:44:43,833 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-11-18 20:44:46,122 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-11-18 20:44:53,182 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-11-18 20:44:55,541 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-11-18 20:45:02,799 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 |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-18 20:45:05,212 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 |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-18 20:45:12,629 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 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-18 20:45:15,111 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 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-18 20:45:20,183 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:45:22,673 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 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-18 20:45:25,169 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 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-18 20:45:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 35 not checked. [2022-11-18 20:45:25,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:25,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689518593] [2022-11-18 20:45:25,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689518593] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:45:25,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:45:25,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-18 20:45:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017982350] [2022-11-18 20:45:25,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:45:25,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 20:45:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:25,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:45:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=40, Unknown=26, NotChecked=350, Total=462 [2022-11-18 20:45:25,172 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:45:27,890 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 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-18 20:45:30,378 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 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .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-11-18 20:45:32,625 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 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-18 20:45:35,021 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 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:45:37,224 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 ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (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| .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-18 20:45:39,578 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 ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (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| .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:45:41,960 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 (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))) (= 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-11-18 20:45:44,341 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 |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .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-11-18 20:45:46,616 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 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:45:48,816 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 ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:45:50,946 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))) (= (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-11-18 20:45:53,200 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 (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)) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-18 20:45:55,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:04,866 WARN L233 SmtUtils]: Spent 5.23s 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-11-18 20:46:06,961 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-11-18 20:46:09,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:11,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:13,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:15,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:15,711 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-11-18 20:46:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:46:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 20:46:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:15,715 INFO L225 Difference]: With dead ends: 22 [2022-11-18 20:46:15,715 INFO L226 Difference]: Without dead ends: 18 [2022-11-18 20:46:15,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 120.2s TimeCoverageRelationStatistics Valid=69, Invalid=56, Unknown=39, NotChecked=828, Total=992 [2022-11-18 20:46:15,717 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:15,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 4 Unknown, 92 Unchecked, 13.1s Time] [2022-11-18 20:46:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-18 20:46:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-18 20:46:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:46:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-11-18 20:46:15,729 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-11-18 20:46:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:15,730 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-11-18 20:46:15,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:46:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-11-18 20:46:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:46:15,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:15,731 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2022-11-18 20:46:15,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:46:15,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:46:15,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1060067472, now seen corresponding path program 5 times [2022-11-18 20:46:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:46:15,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116288587] [2022-11-18 20:46:15,962 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:46:15,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:46:15,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:46:15,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:46:15,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173917c4-fae4-490e-bddb-ed2d984cce8d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 20:46:18,849 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-11-18 20:46:18,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:46:18,963 WARN L261 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 20:46:18,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:46:25,765 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-11-18 20:46:32,578 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-11-18 20:46:39,857 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-11-18 20:46:44,913 WARN L233 SmtUtils]: Spent 5.02s 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-11-18 20:46:47,882 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-11-18 20:46:53,129 WARN L233 SmtUtils]: Spent 5.21s 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-11-18 20:46:55,717 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-11-18 20:47:01,765 WARN L233 SmtUtils]: Spent 5.46s 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-11-18 20:47:20,288 WARN L233 SmtUtils]: Spent 10.99s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:47:26,038 WARN L233 SmtUtils]: Spent 5.72s 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-11-18 20:47:29,752 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-11-18 20:47:35,723 WARN L233 SmtUtils]: Spent 5.93s 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-11-18 20:47:37,805 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-11-18 20:47:44,028 WARN L233 SmtUtils]: Spent 6.18s 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-11-18 20:47:46,514 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 (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) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-18 20:47:53,113 WARN L233 SmtUtils]: Spent 6.56s 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-11-18 20:47:55,790 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 (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) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-18 20:48:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 63 not checked. [2022-11-18 20:48:01,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:48:19,071 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-11-18 20:48:21,165 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-11-18 20:48:27,631 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-11-18 20:48:29,788 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-11-18 20:48:36,465 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-11-18 20:48:38,707 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-11-18 20:48:43,810 WARN L233 SmtUtils]: Spent 5.10s 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-11-18 20:48:50,658 WARN L837 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (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-11-18 20:48:52,923 WARN L859 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (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-11-18 20:49:02,803 WARN L233 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)