./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY --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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 07:28:50,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 07:28:50,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 07:28:50,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 07:28:50,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 07:28:50,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 07:28:50,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 07:28:50,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 07:28:50,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 07:28:50,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 07:28:50,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 07:28:50,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 07:28:50,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 07:28:50,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 07:28:50,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 07:28:50,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 07:28:50,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 07:28:50,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 07:28:50,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 07:28:50,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 07:28:50,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 07:28:50,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 07:28:50,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 07:28:50,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 07:28:50,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 07:28:50,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 07:28:50,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 07:28:50,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 07:28:50,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 07:28:50,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 07:28:50,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 07:28:50,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 07:28:50,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 07:28:50,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 07:28:50,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 07:28:50,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 07:28:50,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 07:28:50,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 07:28:50,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 07:28:50,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 07:28:50,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 07:28:50,326 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 07:28:50,358 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 07:28:50,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 07:28:50,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 07:28:50,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 07:28:50,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 07:28:50,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 07:28:50,366 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 07:28:50,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 07:28:50,367 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 07:28:50,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 07:28:50,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 07:28:50,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 07:28:50,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 07:28:50,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 07:28:50,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 07:28:50,369 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 07:28:50,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 07:28:50,370 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 07:28:50,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 07:28:50,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 07:28:50,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 07:28:50,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 07:28:50,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:28:50,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 07:28:50,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 07:28:50,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 07:28:50,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 07:28:50,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 07:28:50,373 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 07:28:50,374 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 07:28:50,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 07:28:50,375 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 07:28:50,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/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_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2021-11-07 07:28:50,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 07:28:50,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 07:28:50,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 07:28:50,724 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 07:28:50,725 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 07:28:50,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-11-07 07:28:50,823 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data/34b8c4be4/79c5690b7c5e49b3b3c59e1fa08d6ece/FLAG3c8068f25 [2021-11-07 07:28:51,451 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 07:28:51,452 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-11-07 07:28:51,459 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data/34b8c4be4/79c5690b7c5e49b3b3c59e1fa08d6ece/FLAG3c8068f25 [2021-11-07 07:28:51,783 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data/34b8c4be4/79c5690b7c5e49b3b3c59e1fa08d6ece [2021-11-07 07:28:51,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 07:28:51,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 07:28:51,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 07:28:51,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 07:28:51,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 07:28:51,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:51" (1/1) ... [2021-11-07 07:28:51,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56dc01b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:51, skipping insertion in model container [2021-11-07 07:28:51,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:51" (1/1) ... [2021-11-07 07:28:51,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 07:28:51,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 07:28:52,060 WARN L228 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_1b55514c-9830-4718-b902-ff370d06a1f0/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-11-07 07:28:52,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:28:52,078 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 07:28:52,104 WARN L228 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_1b55514c-9830-4718-b902-ff370d06a1f0/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-11-07 07:28:52,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:28:52,125 INFO L208 MainTranslator]: Completed translation [2021-11-07 07:28:52,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52 WrapperNode [2021-11-07 07:28:52,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 07:28:52,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 07:28:52,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 07:28:52,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 07:28:52,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 07:28:52,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 07:28:52,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 07:28:52,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 07:28:52,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 07:28:52,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 07:28:52,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 07:28:52,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 07:28:52,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (1/1) ... [2021-11-07 07:28:52,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:28:52,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:28:52,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 07:28:52,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 07:28:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 07:28:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 07:28:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-07 07:28:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 07:28:52,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 07:28:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-07 07:28:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 07:28:52,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 07:28:52,587 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 07:28:52,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:52 BoogieIcfgContainer [2021-11-07 07:28:52,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 07:28:52,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 07:28:52,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 07:28:52,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 07:28:52,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:28:51" (1/3) ... [2021-11-07 07:28:52,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222fb42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:28:52, skipping insertion in model container [2021-11-07 07:28:52,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:52" (2/3) ... [2021-11-07 07:28:52,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222fb42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:28:52, skipping insertion in model container [2021-11-07 07:28:52,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:52" (3/3) ... [2021-11-07 07:28:52,604 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2021-11-07 07:28:52,616 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 07:28:52,617 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 07:28:52,731 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 07:28:52,755 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 07:28:52,755 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 07:28:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:28:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 07:28:52,789 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:28:52,790 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:28:52,791 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:28:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:28:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2021-11-07 07:28:52,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:28:52,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751460799] [2021-11-07 07:28:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:28:52,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:28:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:28:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:28:53,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:28:53,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751460799] [2021-11-07 07:28:53,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751460799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:28:53,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:28:53,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 07:28:53,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257805731] [2021-11-07 07:28:53,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 07:28:53,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:28:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 07:28:53,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:28:53,251 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:28:53,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:28:53,372 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-11-07 07:28:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 07:28:53,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 07:28:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:28:53,385 INFO L225 Difference]: With dead ends: 31 [2021-11-07 07:28:53,385 INFO L226 Difference]: Without dead ends: 15 [2021-11-07 07:28:53,389 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 07:28:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-07 07:28:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-07 07:28:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:28:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-11-07 07:28:53,429 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2021-11-07 07:28:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:28:53,430 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-11-07 07:28:53,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:28:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-11-07 07:28:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 07:28:53,431 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:28:53,432 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:28:53,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 07:28:53,432 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:28:53,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:28:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1736001843, now seen corresponding path program 1 times [2021-11-07 07:28:53,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:28:53,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851413376] [2021-11-07 07:28:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:28:53,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:28:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:28:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:28:53,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:28:53,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851413376] [2021-11-07 07:28:53,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851413376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:28:53,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:28:53,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 07:28:53,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103931123] [2021-11-07 07:28:53,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 07:28:53,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:28:53,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 07:28:53,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 07:28:53,505 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:28:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:28:53,523 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-11-07 07:28:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 07:28:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 07:28:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:28:53,526 INFO L225 Difference]: With dead ends: 33 [2021-11-07 07:28:53,526 INFO L226 Difference]: Without dead ends: 25 [2021-11-07 07:28:53,527 INFO L786 BasicCegarLoop]: 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 [2021-11-07 07:28:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-07 07:28:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-11-07 07:28:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:28:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-11-07 07:28:53,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2021-11-07 07:28:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:28:53,534 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-11-07 07:28:53,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:28:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-11-07 07:28:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 07:28:53,535 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:28:53,536 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:28:53,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 07:28:53,536 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:28:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:28:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2021-11-07 07:28:53,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:28:53,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823143818] [2021-11-07 07:28:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:28:53,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:28:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:28:53,564 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:28:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:28:53,617 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:28:53,617 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 07:28:53,618 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 07:28:53,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 07:28:53,625 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-07 07:28:53,629 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 07:28:53,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:28:53 BoogieIcfgContainer [2021-11-07 07:28:53,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 07:28:53,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 07:28:53,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 07:28:53,667 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 07:28:53,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:52" (3/4) ... [2021-11-07 07:28:53,672 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 07:28:53,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 07:28:53,674 INFO L168 Benchmark]: Toolchain (without parser) took 1886.08 ms. Allocated memory is still 104.9 MB. Free memory was 78.0 MB in the beginning and 67.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. [2021-11-07 07:28:53,675 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 83.9 MB. Free memory was 43.1 MB in the beginning and 43.1 MB in the end (delta: 65.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:28:53,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.68 ms. Allocated memory is still 104.9 MB. Free memory was 78.0 MB in the beginning and 80.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 07:28:53,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.66 ms. Allocated memory is still 104.9 MB. Free memory was 80.3 MB in the beginning and 78.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 07:28:53,678 INFO L168 Benchmark]: Boogie Preprocessor took 47.01 ms. Allocated memory is still 104.9 MB. Free memory was 78.5 MB in the beginning and 77.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:28:53,679 INFO L168 Benchmark]: RCFGBuilder took 349.64 ms. Allocated memory is still 104.9 MB. Free memory was 77.4 MB in the beginning and 66.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 07:28:53,680 INFO L168 Benchmark]: TraceAbstraction took 1074.79 ms. Allocated memory is still 104.9 MB. Free memory was 66.0 MB in the beginning and 67.3 MB in the end (delta: -1.3 MB). Peak memory consumption was 237.6 kB. Max. memory is 16.1 GB. [2021-11-07 07:28:53,680 INFO L168 Benchmark]: Witness Printer took 5.42 ms. Allocated memory is still 104.9 MB. Free memory is still 67.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:28:53,685 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.36 ms. Allocated memory is still 83.9 MB. Free memory was 43.1 MB in the beginning and 43.1 MB in the end (delta: 65.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 337.68 ms. Allocated memory is still 104.9 MB. Free memory was 78.0 MB in the beginning and 80.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.66 ms. Allocated memory is still 104.9 MB. Free memory was 80.3 MB in the beginning and 78.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.01 ms. Allocated memory is still 104.9 MB. Free memory was 78.5 MB in the beginning and 77.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 349.64 ms. Allocated memory is still 104.9 MB. Free memory was 77.4 MB in the beginning and 66.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1074.79 ms. Allocated memory is still 104.9 MB. Free memory was 66.0 MB in the beginning and 67.3 MB in the end (delta: -1.3 MB). Peak memory consumption was 237.6 kB. Max. memory is 16.1 GB. * Witness Printer took 5.42 ms. Allocated memory is still 104.9 MB. Free memory is still 67.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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: 51]: 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 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; VAL [__return_125=0, __return_main=0] [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_125=0, __return_main=0] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_125=0, __return_main=0] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __return_main=0] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_125=0, __return_main=0] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0] [L51] reach_error() VAL [__return_125=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 37 SDtfs, 40 SDslu, 55 SDs, 0 SdLazy, 19 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 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 [2021-11-07 07:28:53,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY --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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 07:28:56,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 07:28:56,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 07:28:56,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 07:28:56,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 07:28:56,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 07:28:56,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 07:28:56,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 07:28:56,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 07:28:56,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 07:28:56,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 07:28:56,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 07:28:56,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 07:28:56,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 07:28:56,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 07:28:56,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 07:28:56,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 07:28:56,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 07:28:56,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 07:28:56,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 07:28:56,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 07:28:56,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 07:28:56,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 07:28:56,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 07:28:56,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 07:28:56,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 07:28:56,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 07:28:56,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 07:28:56,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 07:28:56,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 07:28:56,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 07:28:56,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 07:28:56,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 07:28:56,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 07:28:56,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 07:28:56,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 07:28:56,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 07:28:56,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 07:28:56,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 07:28:56,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 07:28:56,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 07:28:56,877 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-07 07:28:56,905 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 07:28:56,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 07:28:56,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 07:28:56,906 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 07:28:56,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 07:28:56,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 07:28:56,908 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 07:28:56,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 07:28:56,908 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 07:28:56,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 07:28:56,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 07:28:56,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 07:28:56,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 07:28:56,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 07:28:56,909 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 07:28:56,910 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 07:28:56,910 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 07:28:56,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 07:28:56,910 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 07:28:56,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 07:28:56,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 07:28:56,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 07:28:56,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 07:28:56,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:28:56,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 07:28:56,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 07:28:56,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 07:28:56,912 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-07 07:28:56,912 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 07:28:56,912 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 07:28:56,913 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 07:28:56,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 07:28:56,913 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 07:28:56,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 07:28:56,913 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/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_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2021-11-07 07:28:57,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 07:28:57,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 07:28:57,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 07:28:57,415 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 07:28:57,416 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 07:28:57,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-11-07 07:28:57,498 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data/68f878f9a/11497f97d7164e9c8e30701823f3b14f/FLAG863fc75f4 [2021-11-07 07:28:58,193 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 07:28:58,194 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-11-07 07:28:58,203 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data/68f878f9a/11497f97d7164e9c8e30701823f3b14f/FLAG863fc75f4 [2021-11-07 07:28:58,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/data/68f878f9a/11497f97d7164e9c8e30701823f3b14f [2021-11-07 07:28:58,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 07:28:58,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 07:28:58,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 07:28:58,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 07:28:58,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 07:28:58,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c72816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58, skipping insertion in model container [2021-11-07 07:28:58,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 07:28:58,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 07:28:58,764 WARN L228 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_1b55514c-9830-4718-b902-ff370d06a1f0/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-11-07 07:28:58,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:28:58,785 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 07:28:58,813 WARN L228 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_1b55514c-9830-4718-b902-ff370d06a1f0/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-11-07 07:28:58,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:28:58,834 INFO L208 MainTranslator]: Completed translation [2021-11-07 07:28:58,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58 WrapperNode [2021-11-07 07:28:58,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 07:28:58,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 07:28:58,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 07:28:58,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 07:28:58,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 07:28:58,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 07:28:58,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 07:28:58,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 07:28:58,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 07:28:58,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 07:28:58,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 07:28:58,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 07:28:58,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (1/1) ... [2021-11-07 07:28:58,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:28:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:28:59,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 07:28:59,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 07:28:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-07 07:28:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 07:28:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 07:28:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-07 07:28:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 07:28:59,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 07:28:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 07:29:01,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 07:29:01,929 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 07:29:01,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:29:01 BoogieIcfgContainer [2021-11-07 07:29:01,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 07:29:01,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 07:29:01,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 07:29:01,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 07:29:01,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:28:58" (1/3) ... [2021-11-07 07:29:01,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0e61d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:29:01, skipping insertion in model container [2021-11-07 07:29:01,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:58" (2/3) ... [2021-11-07 07:29:01,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0e61d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:29:01, skipping insertion in model container [2021-11-07 07:29:01,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:29:01" (3/3) ... [2021-11-07 07:29:01,942 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2021-11-07 07:29:01,949 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 07:29:01,950 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 07:29:02,004 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 07:29:02,011 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 07:29:02,012 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 07:29:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:29:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 07:29:02,035 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:29:02,036 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:29:02,037 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:29:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:29:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2021-11-07 07:29:02,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:29:02,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091518052] [2021-11-07 07:29:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:29:02,061 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:29:02,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:29:02,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:29:02,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 07:29:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:29:02,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 07:29:02,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:29:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:29:02,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 07:29:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:29:02,953 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 07:29:02,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091518052] [2021-11-07 07:29:02,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091518052] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 07:29:02,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:29:02,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 07:29:02,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558819097] [2021-11-07 07:29:02,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:29:02,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 07:29:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:29:02,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:29:02,984 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:29:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:29:05,309 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-11-07 07:29:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:29:05,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 07:29:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:29:05,322 INFO L225 Difference]: With dead ends: 34 [2021-11-07 07:29:05,322 INFO L226 Difference]: Without dead ends: 20 [2021-11-07 07:29:05,325 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:29:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-07 07:29:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-11-07 07:29:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:29:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-07 07:29:05,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2021-11-07 07:29:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:29:05,363 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-07 07:29:05,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:29:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-07 07:29:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 07:29:05,365 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:29:05,366 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:29:05,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-07 07:29:05,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 07:29:05,576 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:29:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:29:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2021-11-07 07:29:05,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:29:05,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338745178] [2021-11-07 07:29:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:29:05,582 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:29:05,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:29:05,597 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:29:05,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 07:29:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:29:05,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 07:29:05,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:29:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:29:06,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 07:29:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:29:06,166 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 07:29:06,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338745178] [2021-11-07 07:29:06,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338745178] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 07:29:06,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:29:06,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 07:29:06,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988847595] [2021-11-07 07:29:06,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 07:29:06,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 07:29:06,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 07:29:06,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 07:29:06,184 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:29:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:29:07,155 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-11-07 07:29:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:29:07,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 07:29:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:29:07,158 INFO L225 Difference]: With dead ends: 22 [2021-11-07 07:29:07,158 INFO L226 Difference]: Without dead ends: 18 [2021-11-07 07:29:07,159 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 07:29:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-07 07:29:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-07 07:29:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:29:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2021-11-07 07:29:07,164 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2021-11-07 07:29:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:29:07,165 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-11-07 07:29:07,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:29:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2021-11-07 07:29:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 07:29:07,166 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:29:07,166 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:29:07,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 07:29:07,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 07:29:07,387 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:29:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:29:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2021-11-07 07:29:07,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:29:07,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435531568] [2021-11-07 07:29:07,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:29:07,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:29:07,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:29:07,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:29:07,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 07:29:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:29:07,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-07 07:29:07,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:29:10,326 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 07:29:10,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2021-11-07 07:30:03,795 WARN L207 SmtUtils]: Spent 15.46 s on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2021-11-07 07:31:08,140 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)))))) is different from false [2021-11-07 07:31:10,169 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)))))) is different from true [2021-11-07 07:33:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:33:55,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 07:34:05,015 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2021-11-07 07:34:07,082 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2021-11-07 07:34:17,441 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|))) is different from false [2021-11-07 07:34:19,495 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|))) is different from true [2021-11-07 07:34:29,861 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from false [2021-11-07 07:34:31,922 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2021-11-07 07:34:41,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)))) is different from false [2021-11-07 07:34:58,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)))) is different from false [2021-11-07 07:35:00,273 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)))) is different from true [2021-11-07 07:35:18,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse3 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) is different from false [2021-11-07 07:35:20,301 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse3 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) is different from true [2021-11-07 07:35:34,470 WARN L207 SmtUtils]: Spent 14.14 s on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2021-11-07 07:35:34,471 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 07:35:34,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 102 [2021-11-07 07:36:49,955 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)))))) is different from false [2021-11-07 07:36:52,003 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)))))) is different from true [2021-11-07 07:36:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:36:52,004 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 07:36:52,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435531568] [2021-11-07 07:36:52,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435531568] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 07:36:52,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:36:52,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-07 07:36:52,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408248175] [2021-11-07 07:36:52,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 07:36:52,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 07:36:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 07:36:52,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=75, Unknown=20, NotChecked=200, Total=342 [2021-11-07 07:36:52,008 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:36:55,975 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 07:36:58,026 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 07:37:00,057 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse8 |c_ULTIMATE.start_main_#t~mem8|))) is different from false [2021-11-07 07:37:02,107 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse8 |c_ULTIMATE.start_main_#t~mem8|))) is different from true [2021-11-07 07:37:06,070 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse0 (let ((.cse6 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse1 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (.cse2 (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= .cse0 |c_ULTIMATE.start_main_#t~mem9|) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-07 07:37:08,849 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse0 (let ((.cse6 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse1 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (.cse2 (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2)))))) is different from true [2021-11-07 07:37:10,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse0 (let ((.cse11 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse8 (let ((.cse10 (select .cse4 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0) (let ((.cse5 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ +zero 11 53))))) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse8) (= (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from false [2021-11-07 07:37:12,951 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse0 (let ((.cse11 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse8 (let ((.cse10 (select .cse4 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0) (let ((.cse5 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ +zero 11 53))))) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse8) (= (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-07 07:37:16,827 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse6 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse11 (select .cse8 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (let ((.cse9 (select .cse5 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (= |c_ULTIMATE.start_main_#t~mem10| .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|))) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse2) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-07 07:37:20,322 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse6 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse10 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse7 (let ((.cse9 (select .cse5 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0) (= (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (_ +zero 11 53)) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse7) (= (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-07 07:37:40,482 WARN L207 SmtUtils]: Spent 13.12 s on a formula simplification that was a NOOP. DAG size: 33 [2021-11-07 07:37:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:37:46,374 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-11-07 07:37:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 07:37:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 07:37:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:37:46,384 INFO L225 Difference]: With dead ends: 25 [2021-11-07 07:37:46,384 INFO L226 Difference]: Without dead ends: 20 [2021-11-07 07:37:46,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 115.8s TimeCoverageRelationStatistics Valid=66, Invalid=94, Unknown=32, NotChecked=510, Total=702 [2021-11-07 07:37:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-07 07:37:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-07 07:37:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:37:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-07 07:37:46,390 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-07 07:37:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:37:46,391 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-07 07:37:46,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:37:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-07 07:37:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 07:37:46,392 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:37:46,392 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:37:46,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 07:37:46,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 07:37:46,593 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:37:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:37:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2021-11-07 07:37:46,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:37:46,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849972463] [2021-11-07 07:37:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:37:46,595 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:37:46,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:37:46,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:37:46,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b55514c-9830-4718-b902-ff370d06a1f0/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 07:37:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:37:47,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-07 07:37:47,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:37:50,379 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 07:37:50,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2021-11-07 07:38:14,518 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) c_ULTIMATE.start_main_~main__z~0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)))) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 07:38:56,922 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) c_ULTIMATE.start_main_~main__z~0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)))) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__z~0) (_ +zero 11 53))) is different from false [2021-11-07 07:40:10,671 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0))))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))))))) is different from false [2021-11-07 07:40:12,713 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0))))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))))))) is different from true