./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:13:30,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:13:30,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:13:30,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:13:30,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:13:30,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:13:30,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:13:30,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:13:30,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:13:30,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:13:30,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:13:30,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:13:30,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:13:30,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:13:30,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:13:30,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:13:30,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:13:30,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:13:30,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:13:30,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:13:30,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:13:31,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:13:31,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:13:31,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:13:31,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:13:31,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:13:31,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:13:31,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:13:31,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:13:31,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:13:31,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:13:31,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:13:31,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:13:31,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:13:31,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:13:31,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:13:31,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:13:31,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:13:31,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:13:31,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:13:31,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:13:31,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:13:31,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:13:31,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:13:31,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:13:31,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:13:31,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:13:31,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:13:31,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:13:31,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:13:31,042 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:13:31,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:13:31,042 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:13:31,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:13:31,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:13:31,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:13:31,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:13:31,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:13:31,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:13:31,044 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:13:31,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:13:31,044 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:13:31,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:13:31,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:13:31,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:13:31,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:13:31,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:13:31,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:13:31,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:13:31,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:13:31,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:13:31,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:13:31,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:13:31,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:13:31,046 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:13:31,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:13:31,047 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:13:31,047 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2022-12-13 21:13:31,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:13:31,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:13:31,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:13:31,267 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:13:31,268 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:13:31,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-12-13 21:13:33,851 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:13:33,986 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:13:33,986 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-12-13 21:13:33,990 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/data/8251dbcfe/dff71d5e3efa41f7b76fe6b98bda0f09/FLAG424ce19ab [2022-12-13 21:13:34,000 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/data/8251dbcfe/dff71d5e3efa41f7b76fe6b98bda0f09 [2022-12-13 21:13:34,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:13:34,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:13:34,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:13:34,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:13:34,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:13:34,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8e0a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34, skipping insertion in model container [2022-12-13 21:13:34,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:13:34,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:13:34,124 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-12-13 21:13:34,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:13:34,142 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:13:34,150 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-12-13 21:13:34,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:13:34,163 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:13:34,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34 WrapperNode [2022-12-13 21:13:34,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:13:34,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:13:34,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:13:34,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:13:34,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,187 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-12-13 21:13:34,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:13:34,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:13:34,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:13:34,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:13:34,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,200 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:13:34,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:13:34,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:13:34,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:13:34,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (1/1) ... [2022-12-13 21:13:34,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:13:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:13:34,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:13:34,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:13:34,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:13:34,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:13:34,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:13:34,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:13:34,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 21:13:34,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 21:13:34,317 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:13:34,319 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:13:34,405 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:13:34,409 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:13:34,410 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 21:13:34,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:13:34 BoogieIcfgContainer [2022-12-13 21:13:34,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:13:34,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:13:34,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:13:34,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:13:34,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:13:34" (1/3) ... [2022-12-13 21:13:34,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6661ee38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:13:34, skipping insertion in model container [2022-12-13 21:13:34,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:34" (2/3) ... [2022-12-13 21:13:34,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6661ee38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:13:34, skipping insertion in model container [2022-12-13 21:13:34,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:13:34" (3/3) ... [2022-12-13 21:13:34,418 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-12-13 21:13:34,434 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:13:34,434 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:13:34,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:13:34,477 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;@6fefc7ba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:13:34,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:13:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 21:13:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 21:13:34,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:34,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:34,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:13:34,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2022-12-13 21:13:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:34,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452583039] [2022-12-13 21:13:34,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452583039] [2022-12-13 21:13:34,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452583039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:34,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:34,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:13:34,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694548896] [2022-12-13 21:13:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:34,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:13:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:34,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:13:34,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:13:34,633 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:34,650 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-12-13 21:13:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:13:34,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 21:13:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:34,659 INFO L225 Difference]: With dead ends: 32 [2022-12-13 21:13:34,659 INFO L226 Difference]: Without dead ends: 13 [2022-12-13 21:13:34,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:13:34,666 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:34,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:13:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-13 21:13:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-13 21:13:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:13:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-12-13 21:13:34,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-12-13 21:13:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:34,695 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-12-13 21:13:34,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-12-13 21:13:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 21:13:34,697 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:34,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:34,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:13:34,697 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:13:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2022-12-13 21:13:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:34,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919931841] [2022-12-13 21:13:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:34,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919931841] [2022-12-13 21:13:34,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919931841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:34,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:34,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:13:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330472857] [2022-12-13 21:13:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:34,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:13:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:13:34,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:13:34,763 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:34,775 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-12-13 21:13:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:13:34,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 21:13:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:34,776 INFO L225 Difference]: With dead ends: 24 [2022-12-13 21:13:34,776 INFO L226 Difference]: Without dead ends: 17 [2022-12-13 21:13:34,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:13:34,777 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:34,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:13:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-13 21:13:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-12-13 21:13:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:13:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-12-13 21:13:34,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-12-13 21:13:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:34,783 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-12-13 21:13:34,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-12-13 21:13:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 21:13:34,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:34,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:34,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:13:34,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:13:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-12-13 21:13:34,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:34,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098012394] [2022-12-13 21:13:34,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:13:34,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:13:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:13:34,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:13:34,819 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:13:34,820 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 21:13:34,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:13:34,824 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 21:13:34,826 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:13:34,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:13:34 BoogieIcfgContainer [2022-12-13 21:13:34,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:13:34,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:13:34,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:13:34,839 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:13:34,839 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:13:34" (3/4) ... [2022-12-13 21:13:34,841 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 21:13:34,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:13:34,842 INFO L158 Benchmark]: Toolchain (without parser) took 838.66ms. Allocated memory is still 163.6MB. Free memory was 121.3MB in the beginning and 68.9MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-12-13 21:13:34,842 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:13:34,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.22ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 110.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:13:34,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.98ms. Allocated memory is still 163.6MB. Free memory was 110.7MB in the beginning and 109.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:13:34,844 INFO L158 Benchmark]: Boogie Preprocessor took 14.41ms. Allocated memory is still 163.6MB. Free memory was 109.3MB in the beginning and 108.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:13:34,844 INFO L158 Benchmark]: RCFGBuilder took 209.25ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 98.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:13:34,844 INFO L158 Benchmark]: TraceAbstraction took 424.94ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 68.9MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 21:13:34,845 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 163.6MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:13:34,846 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.14ms. Allocated memory is still 163.6MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.22ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 110.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.98ms. Allocated memory is still 163.6MB. Free memory was 110.7MB in the beginning and 109.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.41ms. Allocated memory is still 163.6MB. Free memory was 109.3MB in the beginning and 108.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 209.25ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 98.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 424.94ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 68.9MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 163.6MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 10]: 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 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 21:13:34,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:13:36,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:13:36,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:13:36,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:13:36,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:13:36,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:13:36,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:13:36,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:13:36,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:13:36,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:13:36,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:13:36,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:13:36,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:13:36,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:13:36,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:13:36,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:13:36,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:13:36,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:13:36,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:13:36,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:13:36,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:13:36,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:13:36,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:13:36,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:13:36,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:13:36,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:13:36,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:13:36,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:13:36,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:13:36,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:13:36,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:13:36,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:13:36,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:13:36,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:13:36,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:13:36,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:13:36,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:13:36,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:13:36,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:13:36,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:13:36,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:13:36,516 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 21:13:36,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:13:36,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:13:36,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:13:36,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:13:36,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:13:36,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:13:36,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:13:36,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:13:36,541 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:13:36,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:13:36,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:13:36,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:13:36,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:13:36,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:13:36,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:13:36,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:13:36,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:13:36,543 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 21:13:36,543 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 21:13:36,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:13:36,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:13:36,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:13:36,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:13:36,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:13:36,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:13:36,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:13:36,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:13:36,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:13:36,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:13:36,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:13:36,545 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2022-12-13 21:13:36,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:13:36,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:13:36,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:13:36,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:13:36,798 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:13:36,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-12-13 21:13:39,398 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:13:39,523 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:13:39,523 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-12-13 21:13:39,528 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/data/19c38d712/3fccb4adc2bb4bf897557e2ac5f6dacf/FLAGf70771b9f [2022-12-13 21:13:39,539 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/data/19c38d712/3fccb4adc2bb4bf897557e2ac5f6dacf [2022-12-13 21:13:39,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:13:39,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:13:39,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:13:39,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:13:39,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:13:39,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2414db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39, skipping insertion in model container [2022-12-13 21:13:39,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:13:39,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:13:39,664 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-12-13 21:13:39,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:13:39,685 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:13:39,702 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-12-13 21:13:39,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:13:39,715 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:13:39,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39 WrapperNode [2022-12-13 21:13:39,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:13:39,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:13:39,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:13:39,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:13:39,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,739 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2022-12-13 21:13:39,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:13:39,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:13:39,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:13:39,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:13:39,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,755 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:13:39,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:13:39,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:13:39,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:13:39,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (1/1) ... [2022-12-13 21:13:39,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:13:39,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:13:39,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:13:39,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:13:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:13:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:13:39,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:13:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 21:13:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 21:13:39,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 21:13:39,872 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:13:39,874 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:13:42,015 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:13:42,020 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:13:42,020 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 21:13:42,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:13:42 BoogieIcfgContainer [2022-12-13 21:13:42,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:13:42,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:13:42,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:13:42,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:13:42,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:13:39" (1/3) ... [2022-12-13 21:13:42,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10bfb0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:13:42, skipping insertion in model container [2022-12-13 21:13:42,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:13:39" (2/3) ... [2022-12-13 21:13:42,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10bfb0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:13:42, skipping insertion in model container [2022-12-13 21:13:42,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:13:42" (3/3) ... [2022-12-13 21:13:42,030 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-12-13 21:13:42,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:13:42,044 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:13:42,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:13:42,085 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;@60723b6b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:13:42,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:13:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 21:13:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 21:13:42,093 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:42,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:42,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:13:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2022-12-13 21:13:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:13:42,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481259718] [2022-12-13 21:13:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:42,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:13:42,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:13:42,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:13:42,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 21:13:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:42,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 21:13:42,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:13:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:42,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:13:42,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:13:42,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481259718] [2022-12-13 21:13:42,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481259718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:42,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:42,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:13:42,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929421989] [2022-12-13 21:13:42,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:42,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:13:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:13:42,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:13:42,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:13:42,228 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:42,243 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-12-13 21:13:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:13:42,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 21:13:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:42,250 INFO L225 Difference]: With dead ends: 32 [2022-12-13 21:13:42,250 INFO L226 Difference]: Without dead ends: 13 [2022-12-13 21:13:42,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:13:42,255 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:42,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:13:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-13 21:13:42,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-13 21:13:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:13:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-12-13 21:13:42,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-12-13 21:13:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:42,280 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-12-13 21:13:42,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-12-13 21:13:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 21:13:42,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:42,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:42,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:13:42,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:13:42,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:13:42,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2022-12-13 21:13:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:13:42,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822023351] [2022-12-13 21:13:42,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:42,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:13:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:13:42,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:13:42,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 21:13:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:42,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:13:42,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:13:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:42,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:13:42,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:13:42,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822023351] [2022-12-13 21:13:42,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822023351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:42,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:42,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:13:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020495256] [2022-12-13 21:13:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:42,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:13:42,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:13:42,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:13:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:13:42,640 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:44,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:13:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:44,769 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-12-13 21:13:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:13:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 21:13:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:44,770 INFO L225 Difference]: With dead ends: 21 [2022-12-13 21:13:44,770 INFO L226 Difference]: Without dead ends: 14 [2022-12-13 21:13:44,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:13:44,771 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:44,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-12-13 21:13:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-13 21:13:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-13 21:13:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:13:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-12-13 21:13:44,775 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-12-13 21:13:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:44,775 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-12-13 21:13:44,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-12-13 21:13:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 21:13:44,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:44,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:44,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-12-13 21:13:44,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:13:44,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:13:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-12-13 21:13:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:13:44,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70247090] [2022-12-13 21:13:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:44,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:13:44,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:13:44,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:13:44,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 21:13:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:45,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 21:13:45,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:13:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:46,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:13:46,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:13:46,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70247090] [2022-12-13 21:13:46,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70247090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:46,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:46,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:13:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135344856] [2022-12-13 21:13:46,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:46,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:13:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:13:46,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:13:46,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:13:46,357 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:47,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:13:51,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:13:53,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:13:55,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:13:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:55,569 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-12-13 21:13:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:13:55,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 21:13:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:55,604 INFO L225 Difference]: With dead ends: 31 [2022-12-13 21:13:55,604 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 21:13:55,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:13:55,605 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:55,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 9.1s Time] [2022-12-13 21:13:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 21:13:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-12-13 21:13:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 21:13:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-13 21:13:55,616 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2022-12-13 21:13:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:55,616 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-13 21:13:55,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:13:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-13 21:13:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 21:13:55,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:55,618 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:55,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 21:13:55,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:13:55,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:13:55,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1269539930, now seen corresponding path program 1 times [2022-12-13 21:13:55,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:13:55,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037819965] [2022-12-13 21:13:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:55,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:13:55,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:13:55,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:13:55,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 21:13:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:55,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 21:13:55,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:13:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:56,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:14:05,034 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-12-13 21:14:07,053 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-12-13 21:14:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:14:07,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:14:07,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037819965] [2022-12-13 21:14:07,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037819965] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 21:14:07,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:14:07,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-12-13 21:14:07,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840716691] [2022-12-13 21:14:07,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:14:07,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:14:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:14:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:14:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2022-12-13 21:14:07,067 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 21:14:09,095 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from false [2022-12-13 21:14:13,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:14:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:14:13,282 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-12-13 21:14:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:14:13,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-13 21:14:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:14:13,284 INFO L225 Difference]: With dead ends: 33 [2022-12-13 21:14:13,284 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 21:14:13,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=31, Invalid=84, Unknown=3, NotChecked=38, Total=156 [2022-12-13 21:14:13,285 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:14:13,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 1 Unknown, 23 Unchecked, 2.2s Time] [2022-12-13 21:14:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 21:14:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-13 21:14:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 21:14:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-12-13 21:14:13,292 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2022-12-13 21:14:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:14:13,293 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-12-13 21:14:13,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 21:14:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-12-13 21:14:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 21:14:13,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:14:13,294 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:14:13,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-12-13 21:14:13,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:14:13,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:14:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:14:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1102679400, now seen corresponding path program 1 times [2022-12-13 21:14:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:14:13,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374103041] [2022-12-13 21:14:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:14:13,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:14:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:14:13,505 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:14:13,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 21:14:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:14:13,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:14:13,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:14:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:14:13,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:14:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:14:13,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:14:13,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374103041] [2022-12-13 21:14:13,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374103041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:14:13,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:14:13,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-12-13 21:14:13,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202554813] [2022-12-13 21:14:13,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:14:13,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:14:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:14:13,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:14:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:14:13,830 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:14:15,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:14:17,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:14:20,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:14:22,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:14:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:14:22,173 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-12-13 21:14:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:14:22,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2022-12-13 21:14:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:14:22,175 INFO L225 Difference]: With dead ends: 44 [2022-12-13 21:14:22,175 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 21:14:22,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:14:22,176 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:14:22,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2022-12-13 21:14:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 21:14:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-13 21:14:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 21:14:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-12-13 21:14:22,187 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2022-12-13 21:14:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:14:22,187 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-12-13 21:14:22,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:14:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-12-13 21:14:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 21:14:22,188 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:14:22,188 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:14:22,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 21:14:22,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:14:22,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:14:22,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:14:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951522, now seen corresponding path program 1 times [2022-12-13 21:14:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:14:22,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678723037] [2022-12-13 21:14:22,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:14:22,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:14:22,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:14:22,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:14:22,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 21:14:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:14:22,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 21:14:22,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:14:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:14:27,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:14:37,592 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-12-13 21:15:10,362 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-12-13 21:15:12,426 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-12-13 21:15:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-12-13 21:15:12,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:15:12,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678723037] [2022-12-13 21:15:12,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678723037] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:15:12,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:15:12,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-12-13 21:15:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849153012] [2022-12-13 21:15:12,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:15:12,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 21:15:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:15:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 21:15:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=5, NotChecked=38, Total=156 [2022-12-13 21:15:12,451 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:15:14,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:15:16,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:15:18,610 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 21:15:20,674 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 21:15:23,285 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-13 21:15:25,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:15:27,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:15:29,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:15:31,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:15:32,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:15:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:15:33,017 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-12-13 21:15:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:15:33,021 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2022-12-13 21:15:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:15:33,022 INFO L225 Difference]: With dead ends: 46 [2022-12-13 21:15:33,022 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 21:15:33,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=53, Invalid=137, Unknown=8, NotChecked=108, Total=306 [2022-12-13 21:15:33,023 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:15:33,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 6 Unknown, 65 Unchecked, 13.7s Time] [2022-12-13 21:15:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 21:15:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-12-13 21:15:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 21:15:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-12-13 21:15:33,033 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2022-12-13 21:15:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:15:33,033 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-12-13 21:15:33,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:15:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-12-13 21:15:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 21:15:33,034 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:15:33,034 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 21:15:33,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 21:15:33,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:15:33,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:15:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:15:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1943528346, now seen corresponding path program 2 times [2022-12-13 21:15:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:15:33,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412507080] [2022-12-13 21:15:33,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:15:33,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:15:33,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:15:33,244 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:15:33,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 21:15:33,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:15:33,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:15:33,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 21:15:33,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:15:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 21:15:38,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:15:49,137 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-12-13 21:16:22,699 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-12-13 21:16:24,762 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-12-13 21:16:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2022-12-13 21:16:24,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:16:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412507080] [2022-12-13 21:16:24,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412507080] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:16:24,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:16:24,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-12-13 21:16:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356908181] [2022-12-13 21:16:24,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:16:24,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 21:16:24,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:16:24,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 21:16:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=5, NotChecked=38, Total=156 [2022-12-13 21:16:24,786 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:26,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:16:28,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:16:31,004 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 21:16:33,071 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 21:16:40,899 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-13 21:16:43,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:16:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:43,413 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-12-13 21:16:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 21:16:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2022-12-13 21:16:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:43,419 INFO L225 Difference]: With dead ends: 44 [2022-12-13 21:16:43,419 INFO L226 Difference]: Without dead ends: 42 [2022-12-13 21:16:43,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=67, Invalid=181, Unknown=8, NotChecked=124, Total=380 [2022-12-13 21:16:43,420 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:43,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 3 Unknown, 48 Unchecked, 6.5s Time] [2022-12-13 21:16:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-13 21:16:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-12-13 21:16:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 21:16:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-12-13 21:16:43,425 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2022-12-13 21:16:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:43,426 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-12-13 21:16:43,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-12-13 21:16:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 21:16:43,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:43,426 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 21:16:43,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 21:16:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:16:43,628 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1358239522, now seen corresponding path program 3 times [2022-12-13 21:16:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:16:43,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579297048] [2022-12-13 21:16:43,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 21:16:43,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:16:43,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:16:43,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:16:43,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 21:16:44,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 21:16:44,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:16:44,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 21:16:44,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:16:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 21:16:56,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:17:07,577 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2022-12-13 21:17:42,598 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-12-13 21:17:44,671 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-12-13 21:18:20,926 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-12-13 21:18:23,044 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2022-12-13 21:18:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2022-12-13 21:18:23,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:18:23,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579297048] [2022-12-13 21:18:23,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579297048] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:18:23,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:18:23,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 21:18:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585033939] [2022-12-13 21:18:23,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:18:23,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 21:18:23,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:18:23,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 21:18:23,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=97, Unknown=10, NotChecked=66, Total=210 [2022-12-13 21:18:23,082 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:18:25,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:18:27,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:18:29,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:18:31,496 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 21:18:33,618 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 21:18:35,693 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-13 21:18:38,798 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse2) (fp.div c_currentRoundingMode .cse6 .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse6) .cse2))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-13 21:18:41,231 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-12-13 21:18:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:41,391 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-12-13 21:18:41,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:18:41,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2022-12-13 21:18:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:41,396 INFO L225 Difference]: With dead ends: 54 [2022-12-13 21:18:41,396 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 21:18:41,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=61, Invalid=159, Unknown=14, NotChecked=186, Total=420 [2022-12-13 21:18:41,397 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:41,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 4 Unknown, 109 Unchecked, 8.7s Time] [2022-12-13 21:18:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 21:18:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-12-13 21:18:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 21:18:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-12-13 21:18:41,404 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 31 [2022-12-13 21:18:41,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:41,404 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-12-13 21:18:41,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:18:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-12-13 21:18:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 21:18:41,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:41,405 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-12-13 21:18:41,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 21:18:41,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:18:41,607 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1721810214, now seen corresponding path program 4 times [2022-12-13 21:18:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:18:41,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790402503] [2022-12-13 21:18:41,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 21:18:41,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:18:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:18:41,613 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:18:41,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 21:18:42,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 21:18:42,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:18:42,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 21:18:42,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 21:18:54,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:19:04,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-12-13 21:19:06,888 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-12-13 21:19:41,815 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-12-13 21:19:43,893 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-12-13 21:20:20,314 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-12-13 21:20:22,441 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2022-12-13 21:20:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2022-12-13 21:20:22,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:20:22,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790402503] [2022-12-13 21:20:22,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790402503] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:20:22,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:20:22,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 21:20:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142161458] [2022-12-13 21:20:22,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:20:22,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 21:20:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:20:22,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 21:20:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=96, Unknown=11, NotChecked=66, Total=210 [2022-12-13 21:20:22,470 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-12-13 21:20:24,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:20:26,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:20:28,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:20:30,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 21:20:32,982 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 21:20:35,037 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)) .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse1))) .cse1))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-12-13 21:20:37,113 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)) .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse1))) .cse1))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-13 21:20:39,423 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse2) (fp.div c_currentRoundingMode .cse6 .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse6) .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-13 21:20:41,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:20:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:20:42,042 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-12-13 21:20:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:20:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 36 [2022-12-13 21:20:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:20:42,048 INFO L225 Difference]: With dead ends: 52 [2022-12-13 21:20:42,048 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 21:20:42,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=61, Invalid=157, Unknown=16, NotChecked=186, Total=420 [2022-12-13 21:20:42,050 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:20:42,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 77 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 4 Unknown, 87 Unchecked, 8.7s Time] [2022-12-13 21:20:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 21:20:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-13 21:20:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 21:20:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-12-13 21:20:42,059 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 36 [2022-12-13 21:20:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:20:42,059 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-12-13 21:20:42,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-12-13 21:20:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-12-13 21:20:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 21:20:42,061 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:20:42,061 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-13 21:20:42,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 21:20:42,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:20:42,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:20:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:20:42,263 INFO L85 PathProgramCache]: Analyzing trace with hash 462807454, now seen corresponding path program 5 times [2022-12-13 21:20:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:20:42,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53480213] [2022-12-13 21:20:42,264 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 21:20:42,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:20:42,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:20:42,265 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:20:42,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e395ef1e-3498-40dd-91e7-7015d59fae8f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 21:20:43,021 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 21:20:43,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:20:43,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 21:20:43,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:21:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 21:21:04,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:21:14,118 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-12-13 21:21:16,146 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2022-12-13 21:21:49,608 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-12-13 21:21:51,678 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-12-13 21:22:27,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)) .cse3))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 (_ +zero 8 24)))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))))) is different from false [2022-12-13 21:22:29,988 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)) .cse3))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 (_ +zero 8 24)))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))))) is different from true [2022-12-13 21:23:14,268 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ +zero 8 24)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse2) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse2) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ +zero 8 24))))) .cse3))) is different from true [2022-12-13 21:24:23,731 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ +zero 8 24)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse2) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse2) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ +zero 8 24))))) .cse3))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) is different from false [2022-12-13 21:24:25,998 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ +zero 8 24)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse2) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse2) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_43|) .cse1)) .cse1)) .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_38| (_ +zero 8 24))))) .cse3))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) is different from true [2022-12-13 21:24:45,895 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4)))) (or (let ((.cse0 (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse4)) .cse4))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 .cse1))) (not (fp.leq .cse3 .cse1)) (not (fp.geq .cse3 (_ +zero 8 24)))))) is different from false [2022-12-13 21:24:48,027 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4)))) (or (let ((.cse0 (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse4)) .cse4))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 .cse1))) (not (fp.leq .cse3 .cse1)) (not (fp.geq .cse3 (_ +zero 8 24)))))) is different from true [2022-12-13 21:25:34,235 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4)))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (let ((.cse1 (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse4)) .cse4))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0))) (not (fp.leq .cse3 .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq .cse3 (_ +zero 8 24)))))) is different from false [2022-12-13 21:25:36,366 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4)))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (let ((.cse1 (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse4)) .cse4))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0))) (not (fp.leq .cse3 .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq .cse3 (_ +zero 8 24)))))) is different from true [2022-12-13 21:27:15,399 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse4)))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 (_ +zero 8 24))) (fp.leq (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse5) .cse4)) .cse4))) .cse2) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse2))))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse4)))) (or (not (fp.leq .cse6 .cse2)) (not (fp.geq .cse6 (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ +zero 8 24)) (fp.geq (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse6) .cse4) (fp.div c_currentRoundingMode .cse7 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse6 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse7) .cse4)) .cse4))) (_ +zero 8 24))))) .cse0) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (let ((.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse4)))) (or (not (fp.leq .cse8 .cse2)) (not (fp.geq .cse8 (_ +zero 8 24))) (fp.geq (let ((.cse9 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse8) .cse4) (fp.div c_currentRoundingMode .cse9 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse8 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse9) .cse4)) .cse4))) (_ +zero 8 24)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse2)))) .cse0) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (let ((.cse10 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse4)))) (or (not (fp.leq .cse10 .cse2)) (not (fp.geq .cse10 (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ +zero 8 24)) (fp.leq (let ((.cse11 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse10) .cse4) (fp.div c_currentRoundingMode .cse11 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse10 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse11) .cse4)) .cse4))) .cse2)))) .cse0))) is different from true