./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:23:31,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:23:31,128 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:23:31,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:23:31,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:23:31,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:23:31,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:23:31,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:23:31,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:23:31,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:23:31,186 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:23:31,187 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:23:31,187 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:23:31,188 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:23:31,188 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:23:31,189 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:23:31,193 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:23:31,194 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:23:31,194 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:23:31,195 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:23:31,195 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:23:31,198 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:23:31,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:23:31,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:23:31,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:23:31,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:23:31,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:23:31,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:23:31,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:23:31,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:23:31,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:23:31,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:23:31,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:23:31,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:23:31,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:23:31,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:23:31,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:23:31,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:23:31,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:23:31,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:23:31,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:23:31,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:23:31,209 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:23:31,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:23:31,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:23:31,210 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:23:31,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:23:31,211 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/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_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2024-11-09 01:23:31,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:23:31,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:23:31,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:23:31,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:23:31,644 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:23:31,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/interpolation2.c Unable to find full path for "g++" [2024-11-09 01:23:34,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:23:34,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:23:34,568 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-09 01:23:34,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/data/d479295b6/19c3aa120663493aa7190234fd01b8b9/FLAG704d0d7e9 [2024-11-09 01:23:34,609 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/data/d479295b6/19c3aa120663493aa7190234fd01b8b9 [2024-11-09 01:23:34,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:23:34,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:23:34,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:34,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:23:34,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:23:34,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:34" (1/1) ... [2024-11-09 01:23:34,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fad284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:34, skipping insertion in model container [2024-11-09 01:23:34,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:34" (1/1) ... [2024-11-09 01:23:34,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:23:34,947 WARN L250 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_77f29283-7ee9-4501-a379-b5d67300ad17/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-09 01:23:34,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:35,005 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:23:35,025 WARN L250 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_77f29283-7ee9-4501-a379-b5d67300ad17/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-09 01:23:35,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:35,067 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:23:35,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35 WrapperNode [2024-11-09 01:23:35,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:35,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:35,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:23:35,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:23:35,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,120 INFO L138 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2024-11-09 01:23:35,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:35,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:23:35,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:23:35,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:23:35,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:23:35,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:23:35,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:23:35,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:23:35,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (1/1) ... [2024-11-09 01:23:35,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:23:35,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:23:35,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:23:35,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:23:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:23:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:23:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:23:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 01:23:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:23:35,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:23:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 01:23:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:23:35,387 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:23:35,390 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:23:35,620 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 01:23:35,620 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:23:35,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:23:35,732 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:23:35,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:35 BoogieIcfgContainer [2024-11-09 01:23:35,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:23:35,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:23:35,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:23:35,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:23:35,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:23:34" (1/3) ... [2024-11-09 01:23:35,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7660566e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:35, skipping insertion in model container [2024-11-09 01:23:35,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:35" (2/3) ... [2024-11-09 01:23:35,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7660566e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:35, skipping insertion in model container [2024-11-09 01:23:35,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:35" (3/3) ... [2024-11-09 01:23:35,748 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2024-11-09 01:23:35,774 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:23:35,775 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:23:35,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:23:35,889 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1bc3a630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:23:35,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:23:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:23:35,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:35,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:23:35,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:35,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash 82257020, now seen corresponding path program 1 times [2024-11-09 01:23:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035578424] [2024-11-09 01:23:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:35,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:23:36,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:23:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035578424] [2024-11-09 01:23:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035578424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:36,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:36,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:23:36,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592801282] [2024-11-09 01:23:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:36,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:23:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:36,416 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2024-11-09 01:23:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:36,512 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2024-11-09 01:23:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:36,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-09 01:23:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:36,533 INFO L225 Difference]: With dead ends: 24 [2024-11-09 01:23:36,534 INFO L226 Difference]: Without dead ends: 15 [2024-11-09 01:23:36,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:36,544 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:36,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 12 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:23:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-09 01:23:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2024-11-09 01:23:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2024-11-09 01:23:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-11-09 01:23:36,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 5 [2024-11-09 01:23:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:36,594 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-09 01:23:36,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2024-11-09 01:23:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2024-11-09 01:23:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 01:23:36,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:36,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:36,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:23:36,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:36,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1387451653, now seen corresponding path program 1 times [2024-11-09 01:23:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:36,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880905797] [2024-11-09 01:23:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:23:36,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:23:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:23:36,742 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 01:23:36,743 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:23:36,747 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:23:36,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:23:36,752 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 01:23:36,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:23:36,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:23:36 BoogieIcfgContainer [2024-11-09 01:23:36,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:23:36,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:23:36,788 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:23:36,788 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:23:36,789 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:35" (3/4) ... [2024-11-09 01:23:36,792 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:23:36,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:23:36,795 INFO L158 Benchmark]: Toolchain (without parser) took 2177.26ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 112.8MB in the beginning and 164.6MB in the end (delta: -51.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-09 01:23:36,795 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 146.8MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:23:36,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.43ms. Allocated memory is still 146.8MB. Free memory was 112.5MB in the beginning and 99.5MB in the end (delta: 13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 01:23:36,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.92ms. Allocated memory is still 146.8MB. Free memory was 99.5MB in the beginning and 97.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:23:36,797 INFO L158 Benchmark]: Boogie Preprocessor took 39.05ms. Allocated memory is still 146.8MB. Free memory was 97.5MB in the beginning and 96.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:23:36,798 INFO L158 Benchmark]: RCFGBuilder took 570.03ms. Allocated memory is still 146.8MB. Free memory was 96.1MB in the beginning and 79.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:23:36,799 INFO L158 Benchmark]: TraceAbstraction took 1049.22ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 78.7MB in the beginning and 165.6MB in the end (delta: -86.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:23:36,799 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 220.2MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:23:36,803 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 146.8MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.43ms. Allocated memory is still 146.8MB. Free memory was 112.5MB in the beginning and 99.5MB in the end (delta: 13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.92ms. Allocated memory is still 146.8MB. Free memory was 99.5MB in the beginning and 97.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.05ms. Allocated memory is still 146.8MB. Free memory was 97.5MB in the beginning and 96.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 570.03ms. Allocated memory is still 146.8MB. Free memory was 96.1MB in the beginning and 79.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1049.22ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 78.7MB in the beginning and 165.6MB in the end (delta: -86.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 220.2MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 28, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={4:0}] [L23] COND FALSE !(i < sizeof(min) / sizeof(min[0])) VAL [i=0, max={4:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] VAL [i=0, max={4:0}] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 7 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 1 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 [2024-11-09 01:23:36,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:23:39,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:23:40,065 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 01:23:40,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:23:40,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:23:40,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:23:40,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:23:40,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:23:40,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:23:40,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:23:40,128 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:23:40,129 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:23:40,129 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:23:40,132 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:23:40,132 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:23:40,133 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:23:40,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:23:40,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:23:40,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:23:40,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:23:40,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:23:40,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:23:40,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:23:40,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:23:40,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:23:40,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:23:40,142 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:23:40,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:23:40,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:23:40,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:23:40,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:23:40,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:23:40,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:23:40,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:23:40,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:23:40,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:23:40,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:23:40,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:23:40,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:23:40,146 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 01:23:40,146 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:23:40,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:23:40,148 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:23:40,148 INFO L153 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_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/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_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2024-11-09 01:23:40,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:23:40,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:23:40,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:23:40,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:23:40,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:23:40,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/interpolation2.c Unable to find full path for "g++" [2024-11-09 01:23:43,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:23:43,656 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:23:43,656 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-09 01:23:43,670 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/data/70f21b0eb/0d59868d63114c08abad5dfd42605fd1/FLAG527fde7dd [2024-11-09 01:23:43,693 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/data/70f21b0eb/0d59868d63114c08abad5dfd42605fd1 [2024-11-09 01:23:43,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:23:43,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:23:43,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:43,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:23:43,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:23:43,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:43" (1/1) ... [2024-11-09 01:23:43,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae1360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:43, skipping insertion in model container [2024-11-09 01:23:43,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:43" (1/1) ... [2024-11-09 01:23:43,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:23:43,991 WARN L250 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_77f29283-7ee9-4501-a379-b5d67300ad17/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-09 01:23:44,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:44,070 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:23:44,093 WARN L250 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_77f29283-7ee9-4501-a379-b5d67300ad17/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-09 01:23:44,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:44,181 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:23:44,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44 WrapperNode [2024-11-09 01:23:44,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:44,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:44,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:23:44,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:23:44,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,289 INFO L138 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-11-09 01:23:44,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:44,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:23:44,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:23:44,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:23:44,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:23:44,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:23:44,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:23:44,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:23:44,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (1/1) ... [2024-11-09 01:23:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:23:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:23:44,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:23:44,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:23:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:23:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-09 01:23:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 01:23:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:23:44,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-09 01:23:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:23:44,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:23:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:23:44,585 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:23:44,589 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:23:47,288 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-09 01:23:47,289 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:23:47,316 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:23:47,316 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:23:47,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:47 BoogieIcfgContainer [2024-11-09 01:23:47,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:23:47,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:23:47,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:23:47,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:23:47,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:23:43" (1/3) ... [2024-11-09 01:23:47,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7d010e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:47, skipping insertion in model container [2024-11-09 01:23:47,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:44" (2/3) ... [2024-11-09 01:23:47,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7d010e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:47, skipping insertion in model container [2024-11-09 01:23:47,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:47" (3/3) ... [2024-11-09 01:23:47,337 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2024-11-09 01:23:47,366 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:23:47,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:23:47,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:23:47,494 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d30ea89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:23:47,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:23:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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) [2024-11-09 01:23:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:23:47,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:47,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:47,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:47,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1235864049, now seen corresponding path program 1 times [2024-11-09 01:23:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:23:47,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670953673] [2024-11-09 01:23:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:47,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:23:47,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:23:47,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:23:47,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:23:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:48,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:23:48,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:23:48,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:23:48,287 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:23:48,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670953673] [2024-11-09 01:23:48,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670953673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:48,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:48,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:23:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048136298] [2024-11-09 01:23:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:48,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:23:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:23:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:23:48,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:23:48,335 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2024-11-09 01:23:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:48,360 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-09 01:23:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:23:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 01:23:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:48,374 INFO L225 Difference]: With dead ends: 29 [2024-11-09 01:23:48,376 INFO L226 Difference]: Without dead ends: 13 [2024-11-09 01:23:48,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:23:48,388 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:48,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:23:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-09 01:23:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-09 01:23:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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) [2024-11-09 01:23:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-09 01:23:48,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2024-11-09 01:23:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:48,440 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-09 01:23:48,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2024-11-09 01:23:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2024-11-09 01:23:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:23:48,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:48,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:48,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:23:48,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:23:48,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:48,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1178605747, now seen corresponding path program 1 times [2024-11-09 01:23:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:23:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495103462] [2024-11-09 01:23:48,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:48,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:23:48,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:23:48,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:23:48,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:23:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:49,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:23:49,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:23:49,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:23:49,320 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:23:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495103462] [2024-11-09 01:23:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495103462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:49,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:49,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:23:49,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495408076] [2024-11-09 01:23:49,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:49,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:23:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:49,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:49,327 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-09 01:23:51,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:23:53,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:23:55,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:23:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:55,980 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-09 01:23:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 01:23:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:55,982 INFO L225 Difference]: With dead ends: 21 [2024-11-09 01:23:55,983 INFO L226 Difference]: Without dead ends: 17 [2024-11-09 01:23:55,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:55,985 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:55,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2024-11-09 01:23:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-09 01:23:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2024-11-09 01:23:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2024-11-09 01:23:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-09 01:23:55,994 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2024-11-09 01:23:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:55,994 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-09 01:23:55,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-09 01:23:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-11-09 01:23:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 01:23:55,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:55,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:56,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:23:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:23:56,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:56,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash 879110038, now seen corresponding path program 1 times [2024-11-09 01:23:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:23:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856109709] [2024-11-09 01:23:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:56,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:23:56,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:23:56,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:23:56,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:23:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:57,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 01:23:57,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:24:09,056 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 33 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 01:24:09,057 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-09 01:24:09,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 612 treesize of output 312 [2024-11-09 01:27:19,905 WARN L851 $PredicateComparison]: unable to prove that (or (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 .cse3) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse4 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse6)) (fp.sub roundNearestTiesToEven .cse4 .cse6))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse6 .cse7))))))))))))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse8) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse9 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse9) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse10) (not (fp.geq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse10)) (fp.sub roundNearestTiesToEven .cse9 .cse10))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (= .cse10 .cse7))))))))) (= .cse11 .cse3))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-11-09 01:27:46,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 .cse3) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse4 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse6)) (fp.sub roundNearestTiesToEven .cse4 .cse6))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse6 .cse7))))))))))))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse8) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse9 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse9) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse10) (not (fp.geq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse10)) (fp.sub roundNearestTiesToEven .cse9 .cse10))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (= .cse10 .cse7))))))))) (= .cse11 .cse3))))))))) is different from false [2024-11-09 01:27:48,420 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 .cse3) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse4 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse6)) (fp.sub roundNearestTiesToEven .cse4 .cse6))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse6 .cse7))))))))))))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse8) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse9 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse9) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse10) (not (fp.geq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse10)) (fp.sub roundNearestTiesToEven .cse9 .cse10))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (= .cse10 .cse7))))))))) (= .cse11 .cse3))))))))) is different from true [2024-11-09 01:27:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:48,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:48,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:48,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856109709] [2024-11-09 01:27:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856109709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:48,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:27:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657439618] [2024-11-09 01:27:48,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:48,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:27:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:48,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:27:48,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=62, Unknown=3, NotChecked=34, Total=132 [2024-11-09 01:27:48,427 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:51,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:27:53,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:27:55,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:27:57,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:27:59,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:01,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:03,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:05,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:07,672 WARN L851 $PredicateComparison]: unable to prove that (and (or (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 .cse3) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse4 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse6)) (fp.sub roundNearestTiesToEven .cse4 .cse6))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse6 .cse7))))))))))))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse8) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse9 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse9) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse10) (not (fp.geq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse10)) (fp.sub roundNearestTiesToEven .cse9 .cse10))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (= .cse10 .cse7))))))))) (= .cse11 .cse3))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 01:28:09,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:11,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:13,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:15,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:17,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:19,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:21,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:23,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:25,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:27,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:29,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:31,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:33,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:35,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:37,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:39,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:40,101 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-11-09 01:28:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:28:40,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 01:28:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:40,103 INFO L225 Difference]: With dead ends: 29 [2024-11-09 01:28:40,103 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 01:28:40,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=35, Invalid=63, Unknown=4, NotChecked=54, Total=156 [2024-11-09 01:28:40,105 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 49.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:40,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 24 Unknown, 70 Unchecked, 49.5s Time] [2024-11-09 01:28:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 01:28:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-11-09 01:28:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2024-11-09 01:28:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-09 01:28:40,113 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2024-11-09 01:28:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:40,113 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 01:28:40,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-09 01:28:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 01:28:40,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:40,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:40,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:28:40,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:40,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:40,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 486083028, now seen corresponding path program 1 times [2024-11-09 01:28:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:28:40,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314260584] [2024-11-09 01:28:40,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:40,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:40,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:28:40,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:28:40,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:28:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:28:40,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:41,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:41,051 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:28:41,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314260584] [2024-11-09 01:28:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314260584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:28:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233275083] [2024-11-09 01:28:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:41,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:28:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:28:41,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:28:41,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:41,055 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-11-09 01:28:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:41,167 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-09 01:28:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:28:41,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2024-11-09 01:28:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:41,169 INFO L225 Difference]: With dead ends: 28 [2024-11-09 01:28:41,169 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 01:28:41,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:41,171 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:41,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 01:28:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 01:28:41,176 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) [2024-11-09 01:28:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-09 01:28:41,177 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2024-11-09 01:28:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:41,177 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-09 01:28:41,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-11-09 01:28:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-09 01:28:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:28:41,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:41,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:41,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:41,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:41,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:41,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1484391956, now seen corresponding path program 1 times [2024-11-09 01:28:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:28:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445293988] [2024-11-09 01:28:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:41,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:41,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:28:41,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:28:41,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:28:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:28:41,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:41,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:42,197 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:28:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445293988] [2024-11-09 01:28:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445293988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1263049707] [2024-11-09 01:28:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:28:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:28:42,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:28:42,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-09 01:28:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:43,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:28:43,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:43,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1263049707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977117681] [2024-11-09 01:28:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:43,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:28:43,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:43,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 01:28:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:44,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:28:44,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:44,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:44,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977117681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:44,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:28:44,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2024-11-09 01:28:44,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72216183] [2024-11-09 01:28:44,396 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:44,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:28:44,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:28:44,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:28:44,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:44,398 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2024-11-09 01:28:46,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:48,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:50,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:52,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:54,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:56,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:28:59,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:01,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:03,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:05,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:07,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:09,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:11,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:13,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:15,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:17,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:19,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:21,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:23,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:25,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:27,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:29,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:31,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:33,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:29:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:33,864 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-09 01:29:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:29:33,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 [2024-11-09 01:29:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:33,943 INFO L225 Difference]: With dead ends: 30 [2024-11-09 01:29:33,943 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 01:29:33,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:29:33,944 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:33,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 24 Unknown, 0 Unchecked, 49.4s Time] [2024-11-09 01:29:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 01:29:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-09 01:29:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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) [2024-11-09 01:29:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-09 01:29:33,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2024-11-09 01:29:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:33,969 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-09 01:29:33,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2024-11-09 01:29:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-09 01:29:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 01:29:33,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:33,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:33,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 01:29:34,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-09 01:29:34,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 01:29:34,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:29:34,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 219394205, now seen corresponding path program 1 times [2024-11-09 01:29:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:29:34,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074893008] [2024-11-09 01:29:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:34,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:34,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:29:34,589 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:34,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77f29283-7ee9-4501-a379-b5d67300ad17/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:29:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:35,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 01:29:35,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:53,251 WARN L286 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 37 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 01:29:53,251 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2024-11-09 01:29:53,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 659 treesize of output 335 [2024-11-09 01:34:42,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse8 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse2)) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse5) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse7)) (fp.sub roundNearestTiesToEven .cse5 .cse7))) .cse8))))) (= .cse3 .cse7)))) (= .cse6 .cse9)))))))))))) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse10) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse11 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse12) (not (fp.leq (fp.add roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse14)) (fp.sub roundNearestTiesToEven .cse12 .cse14))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse12)))) (= .cse3 .cse14)))) (= .cse13 .cse9)))) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse11)))))))))))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse15 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse19 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse17 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse16 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse18 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (= .cse15 .cse3) (= .cse4 .cse16) (= .cse0 .cse17) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse15)) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse16) (= .cse3 .cse18) (= .cse19 .cse9) (fp.geq (fp.add roundNearestTiesToEven .cse19 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse18)) (fp.sub roundNearestTiesToEven .cse16 .cse18))) .cse8)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2024-11-09 01:35:13,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))) (or (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse2)) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse5) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse7)) (fp.sub roundNearestTiesToEven .cse5 .cse7))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) (= .cse3 .cse7)))) (= .cse6 .cse8)))))))))))) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse9) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse10 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse11) (not (fp.leq (fp.add roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse13)) (fp.sub roundNearestTiesToEven .cse11 .cse13))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse11)))) (= .cse3 .cse13)))) (= .cse12 .cse8)))) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse10)))))))))))) is different from false [2024-11-09 01:35:15,928 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))) (or (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse2)) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse5) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse7)) (fp.sub roundNearestTiesToEven .cse5 .cse7))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) (= .cse3 .cse7)))) (= .cse6 .cse8)))))))))))) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse9) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse10 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse11) (not (fp.leq (fp.add roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse13)) (fp.sub roundNearestTiesToEven .cse11 .cse13))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse11)))) (= .cse3 .cse13)))) (= .cse12 .cse8)))) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse10)))))))))))) is different from true [2024-11-09 01:35:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:35:15,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:26,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) is different from false [2024-11-09 01:35:28,870 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) is different from true [2024-11-09 01:35:43,678 WARN L851 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0))))) is different from false [2024-11-09 01:35:45,735 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0))))) is different from true [2024-11-09 01:36:00,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0))))))) is different from false [2024-11-09 01:36:02,631 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0))))))) is different from true [2024-11-09 01:36:34,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from false [2024-11-09 01:36:36,479 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from true [2024-11-09 01:36:55,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (let ((.cse9 (select .cse1 (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse7 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))))) is different from false [2024-11-09 01:36:57,582 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (let ((.cse9 (select .cse1 (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse7 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))))) is different from true [2024-11-09 01:37:33,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2024-11-09 01:37:35,831 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2024-11-09 01:37:59,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2024-11-09 01:38:01,306 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2024-11-09 01:38:24,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2024-11-09 01:38:26,728 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2024-11-09 01:38:54,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse9 (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse0 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))))) is different from false