./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E --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 f19691bed5efac00db0d1847b045469616a042925c91020b77da6e1bd979a486 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:35:39,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:35:39,280 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:35:39,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:35:39,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:35:39,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:35:39,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:35:39,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:35:39,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:35:39,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:35:39,329 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:35:39,329 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:35:39,329 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:35:39,329 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:35:39,330 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:35:39,330 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:35:39,331 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:35:39,331 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:35:39,331 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:35:39,331 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:35:39,331 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:35:39,331 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:35:39,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:35:39,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:35:39,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:35:39,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:35:39,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:35:39,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:35:39,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:35:39,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:35:39,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:35:39,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:35:39,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:35:39,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:35:39,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:35:39,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:35:39,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:35:39,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:35:39,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:35:39,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:35:39,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:35:39,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:35:39,335 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:35:39,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:35:39,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:35:39,335 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:35:39,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:35:39,335 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E 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 -> f19691bed5efac00db0d1847b045469616a042925c91020b77da6e1bd979a486 [2024-11-13 23:35:39,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:35:39,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:35:39,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:35:39,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:35:39,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:35:39,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i Unable to find full path for "g++" [2024-11-13 23:35:42,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:35:42,407 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:35:42,408 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i [2024-11-13 23:35:42,427 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/data/4fd289ed0/345aa7e707e74260b0aafcd7dfdaf2c8/FLAG0c9b4bc4c [2024-11-13 23:35:42,457 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/data/4fd289ed0/345aa7e707e74260b0aafcd7dfdaf2c8 [2024-11-13 23:35:42,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:35:42,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:35:42,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:35:42,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:35:42,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:35:42,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:42,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cd3147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42, skipping insertion in model container [2024-11-13 23:35:42,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:42,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:35:42,731 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_da0390ac-9045-4737-906a-7551b386c16c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i[919,932] [2024-11-13 23:35:42,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:35:42,863 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:35:42,876 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_da0390ac-9045-4737-906a-7551b386c16c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i[919,932] [2024-11-13 23:35:42,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:35:42,942 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:35:42,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42 WrapperNode [2024-11-13 23:35:42,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:35:42,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:35:42,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:35:42,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:35:42,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:42,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,012 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 255 [2024-11-13 23:35:43,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:35:43,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:35:43,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:35:43,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:35:43,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:35:43,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:35:43,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:35:43,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:35:43,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (1/1) ... [2024-11-13 23:35:43,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:35:43,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:35:43,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:35:43,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:35:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:35:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:35:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:35:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:35:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:35:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:35:43,345 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:35:43,348 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:35:44,006 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 23:35:44,006 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:35:44,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:35:44,586 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:35:44,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:35:44 BoogieIcfgContainer [2024-11-13 23:35:44,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:35:44,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:35:44,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:35:44,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:35:44,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:35:42" (1/3) ... [2024-11-13 23:35:44,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412b5eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:35:44, skipping insertion in model container [2024-11-13 23:35:44,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:42" (2/3) ... [2024-11-13 23:35:44,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412b5eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:35:44, skipping insertion in model container [2024-11-13 23:35:44,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:35:44" (3/3) ... [2024-11-13 23:35:44,604 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i [2024-11-13 23:35:44,626 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:35:44,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:35:44,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:35:44,719 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;@5fcaaa55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:35:44,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:35:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:35:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-13 23:35:44,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:35:44,749 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:35:44,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:35:44,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:35:44,755 INFO L85 PathProgramCache]: Analyzing trace with hash -765776112, now seen corresponding path program 1 times [2024-11-13 23:35:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:35:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548655405] [2024-11-13 23:35:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:35:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:35:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:35:46,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [332796647] [2024-11-13 23:35:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:35:46,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:35:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:35:46,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:35:46,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 23:35:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:35:47,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:35:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:35:48,163 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:35:48,167 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:35:48,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 23:35:48,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 23:35:48,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:35:48,383 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 23:35:48,719 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:35:48,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:35:48 BoogieIcfgContainer [2024-11-13 23:35:48,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:35:48,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:35:48,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:35:48,730 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:35:48,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:35:44" (3/4) ... [2024-11-13 23:35:48,734 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:35:48,735 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:35:48,740 INFO L158 Benchmark]: Toolchain (without parser) took 6273.63ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 93.4MB in the beginning and 195.1MB in the end (delta: -101.7MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. [2024-11-13 23:35:48,740 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:35:48,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.66ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 78.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:35:48,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.46ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 75.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:35:48,744 INFO L158 Benchmark]: Boogie Preprocessor took 68.89ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:35:48,745 INFO L158 Benchmark]: RCFGBuilder took 1503.57ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 56.4MB in the end (delta: 17.0MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-13 23:35:48,745 INFO L158 Benchmark]: TraceAbstraction took 4137.89ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 55.8MB in the beginning and 195.8MB in the end (delta: -140.0MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2024-11-13 23:35:48,745 INFO L158 Benchmark]: Witness Printer took 5.79ms. Allocated memory is still 352.3MB. Free memory was 195.8MB in the beginning and 195.1MB in the end (delta: 673.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:35:48,748 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.66ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 78.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.46ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 75.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.89ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1503.57ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 56.4MB in the end (delta: 17.0MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4137.89ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 55.8MB in the beginning and 195.8MB in the end (delta: -140.0MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. * Witness Printer took 5.79ms. Allocated memory is still 352.3MB. Free memory was 195.8MB in the beginning and 195.1MB in the end (delta: 673.8kB). 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: 19]: 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 212, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of bitwiseOr at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryArithmeticFLOAToperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] double var_1_30 = 64.25; [L46] signed short int var_1_31 = 10; [L47] signed short int var_1_34 = 16; [L48] signed short int var_1_35 = 8; [L49] signed short int var_1_37 = 64; [L50] signed short int var_1_38 = 128; [L51] float var_1_39 = 4.7; [L52] unsigned short int var_1_40 = 100; [L53] signed short int var_1_41 = 4; [L54] unsigned long int var_1_43 = 64; [L55] unsigned long int var_1_44 = 5; [L56] float var_1_45 = 31.6; [L57] float var_1_46 = 24.875; [L58] unsigned short int var_1_47 = 64; [L59] double var_1_48 = 16.75; [L221] isInitial = 1 [L222] FCALL initially() [L223] COND TRUE 1 [L224] FCALL updateLastVariables() [L225] CALL updateVariables() [L146] var_1_6 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) [L148] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) [L150] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L152] var_1_9 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L153] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L154] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L154] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L155] var_1_10 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L156] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L157] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L157] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L158] var_1_12 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L159] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L160] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L160] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L161] var_1_13 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L162] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L163] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L163] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L164] var_1_14 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L165] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L166] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L166] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L167] var_1_15 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L168] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L169] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L169] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L170] var_1_16 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L171] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L172] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L172] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L173] var_1_17 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L174] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L175] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L175] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L176] var_1_19 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L177] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L178] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L178] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L179] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L179] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L180] var_1_22 = __VERIFIER_nondet_short() [L181] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L181] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L182] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L182] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L183] var_1_24 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L184] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L185] var_1_25 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L186] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L187] var_1_26 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L188] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L189] var_1_30 = __VERIFIER_nondet_double() [L190] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L190] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L191] var_1_34 = __VERIFIER_nondet_short() [L192] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L192] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L193] CALL assume_abort_if_not(var_1_34 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L193] RET assume_abort_if_not(var_1_34 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L194] var_1_35 = __VERIFIER_nondet_short() [L195] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L195] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L196] CALL assume_abort_if_not(var_1_35 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L196] RET assume_abort_if_not(var_1_35 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L197] var_1_37 = __VERIFIER_nondet_short() [L198] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L198] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L199] CALL assume_abort_if_not(var_1_37 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L199] RET assume_abort_if_not(var_1_37 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L200] var_1_38 = __VERIFIER_nondet_short() [L201] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L201] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L202] CALL assume_abort_if_not(var_1_38 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L202] RET assume_abort_if_not(var_1_38 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L203] var_1_43 = __VERIFIER_nondet_ulong() [L204] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L204] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L205] CALL assume_abort_if_not(var_1_43 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L205] RET assume_abort_if_not(var_1_43 <= 4294967295) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L206] CALL assume_abort_if_not(var_1_43 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L206] RET assume_abort_if_not(var_1_43 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L207] var_1_44 = __VERIFIER_nondet_ulong() [L208] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L208] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L209] CALL assume_abort_if_not(var_1_44 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L209] RET assume_abort_if_not(var_1_44 <= 4294967295) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L210] CALL assume_abort_if_not(var_1_44 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_44=50, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L210] RET assume_abort_if_not(var_1_44 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_44=50, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L211] var_1_46 = __VERIFIER_nondet_float() [L212] CALL assume_abort_if_not((var_1_46 >= -461168.6018427382800e+13F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 4611686.018427382800e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_44=50, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) [L212] RET assume_abort_if_not((var_1_46 >= -461168.6018427382800e+13F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 4611686.018427382800e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=50, var_1_44=50, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16323] [L225] RET updateVariables() [L226] CALL step() [L63] var_1_29 = var_1_30 [L64] COND FALSE !(var_1_18 && var_1_18) [L67] COND FALSE !(((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_34) [L75] COND TRUE var_1_23 < var_1_30 [L76] COND TRUE var_1_20 > var_1_34 [L77] var_1_39 = var_1_30 [L82] var_1_40 = var_1_35 [L83] COND FALSE !(\read(var_1_18)) [L90] EXPR var_1_34 | var_1_8 [L90] COND TRUE var_1_20 > (var_1_34 | var_1_8) [L91] COND TRUE ((1u ^ var_1_34) / var_1_43) > (var_1_35 / var_1_44) [L92] var_1_41 = var_1_34 [L100] COND FALSE !(var_1_1 || var_1_18) [L103] var_1_47 = var_1_37 [L104] var_1_48 = var_1_46 [L105] var_1_8 = (var_1_9 - (2 + var_1_10)) [L106] COND TRUE var_1_22 != var_1_12 [L107] COND TRUE var_1_10 <= var_1_17 [L108] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) [L113] COND FALSE !(! ((var_1_9 - var_1_22) > var_1_12)) [L116] COND TRUE var_1_23 == var_1_23 [L117] COND TRUE var_1_15 >= (var_1_27 / var_1_19) [L118] var_1_18 = var_1_7 [L121] COND FALSE !((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) [L124] var_1_20 = var_1_19 [L126] COND TRUE \read(var_1_18) [L127] var_1_1 = (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6) [L131] COND FALSE !(\read(var_1_1)) [L134] COND FALSE !(var_1_27 >= var_1_14) [L137] COND TRUE \read(var_1_7) [L138] var_1_11 = var_1_16 [L226] RET step() [L227] CALL, EXPR property() [L217-L218] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; [L227] RET, EXPR property() [L227] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=5, var_1_1=0, var_1_20=5, var_1_22=16383, var_1_23=0, var_1_25=0, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=2, var_1_40=1, var_1_41=99, var_1_43=50, var_1_44=50, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=16320, var_1_9=16323] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-62, var_1_14=-62, var_1_15=52, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=5, var_1_1=0, var_1_20=5, var_1_22=16383, var_1_23=0, var_1_25=0, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=99, var_1_35=1, var_1_37=0, var_1_38=100, var_1_39=2, var_1_40=1, var_1_41=99, var_1_43=50, var_1_44=50, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=16320, var_1_9=16323] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 1, TraceHistogramMax: 44, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 23:35:48,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E --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 f19691bed5efac00db0d1847b045469616a042925c91020b77da6e1bd979a486 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:35:52,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:35:52,386 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-13 23:35:52,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:35:52,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:35:52,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:35:52,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:35:52,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:35:52,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:35:52,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:35:52,471 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:35:52,475 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:35:52,475 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:35:52,475 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:35:52,475 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:35:52,476 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:35:52,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:35:52,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:35:52,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:35:52,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:35:52,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:35:52,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:35:52,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:35:52,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:35:52,480 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:35:52,480 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:35:52,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:35:52,480 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:35:52,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:35:52,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:35:52,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:35:52,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:35:52,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:35:52,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:35:52,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:35:52,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:35:52,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:35:52,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:35:52,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:35:52,493 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:35:52,493 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:35:52,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:35:52,493 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:35:52,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E 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 -> f19691bed5efac00db0d1847b045469616a042925c91020b77da6e1bd979a486 [2024-11-13 23:35:52,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:35:52,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:35:52,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:35:52,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:35:52,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:35:52,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i Unable to find full path for "g++" [2024-11-13 23:35:54,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:35:55,275 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:35:55,284 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i [2024-11-13 23:35:55,314 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/data/9d3e400c0/799150e5bfe14c1f99163f64bdabca4e/FLAG3d8e2c255 [2024-11-13 23:35:55,566 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/data/9d3e400c0/799150e5bfe14c1f99163f64bdabca4e [2024-11-13 23:35:55,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:35:55,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:35:55,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:35:55,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:35:55,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:35:55,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:55,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5098db2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55, skipping insertion in model container [2024-11-13 23:35:55,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:55,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:35:55,785 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_da0390ac-9045-4737-906a-7551b386c16c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i[919,932] [2024-11-13 23:35:55,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:35:55,889 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:35:55,898 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_da0390ac-9045-4737-906a-7551b386c16c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i[919,932] [2024-11-13 23:35:55,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:35:55,982 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:35:55,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55 WrapperNode [2024-11-13 23:35:55,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:35:55,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:35:55,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:35:55,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:35:55,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,063 INFO L138 Inliner]: procedures = 27, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2024-11-13 23:35:56,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:35:56,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:35:56,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:35:56,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:35:56,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:35:56,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:35:56,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:35:56,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:35:56,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (1/1) ... [2024-11-13 23:35:56,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:35:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:35:56,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:35:56,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:35:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:35:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:35:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:35:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:35:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:35:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:35:56,379 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:35:56,381 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:36:00,421 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 23:36:00,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:36:00,443 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:36:00,445 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:36:00,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:36:00 BoogieIcfgContainer [2024-11-13 23:36:00,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:36:00,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:36:00,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:36:00,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:36:00,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:35:55" (1/3) ... [2024-11-13 23:36:00,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206d62dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:36:00, skipping insertion in model container [2024-11-13 23:36:00,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:35:55" (2/3) ... [2024-11-13 23:36:00,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206d62dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:36:00, skipping insertion in model container [2024-11-13 23:36:00,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:36:00" (3/3) ... [2024-11-13 23:36:00,474 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i [2024-11-13 23:36:00,494 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:36:00,499 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:36:00,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:36:00,596 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;@27a9f421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:36:00,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:36:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:36:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-13 23:36:00,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:36:00,625 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:36:00,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:36:00,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:36:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2138072955, now seen corresponding path program 1 times [2024-11-13 23:36:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:36:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899795191] [2024-11-13 23:36:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:00,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-13 23:36:00,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:36:00,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:00,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:01,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 23:36:01,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1094 proven. 0 refuted. 0 times theorem prover too weak. 2690 trivial. 0 not checked. [2024-11-13 23:36:01,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:36:01,678 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:36:01,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899795191] [2024-11-13 23:36:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899795191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:36:01,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:36:01,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:36:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266654695] [2024-11-13 23:36:01,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:36:01,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 23:36:01,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:36:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 23:36:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:36:01,718 INFO L87 Difference]: Start difference. First operand has 109 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 23:36:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:36:01,793 INFO L93 Difference]: Finished difference Result 211 states and 390 transitions. [2024-11-13 23:36:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 23:36:01,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 265 [2024-11-13 23:36:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:36:01,811 INFO L225 Difference]: With dead ends: 211 [2024-11-13 23:36:01,812 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 23:36:01,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 264 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-13 23:36:01,824 INFO L432 NwaCegarLoop]: 168 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, 168 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-13 23:36:01,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:36:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 23:36:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-13 23:36:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:36:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 168 transitions. [2024-11-13 23:36:01,895 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 168 transitions. Word has length 265 [2024-11-13 23:36:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:36:01,895 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 168 transitions. [2024-11-13 23:36:01,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 23:36:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 168 transitions. [2024-11-13 23:36:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-13 23:36:01,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:36:01,903 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:36:01,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:02,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:02,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:36:02,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:36:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1173814471, now seen corresponding path program 1 times [2024-11-13 23:36:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:36:02,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229991240] [2024-11-13 23:36:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:02,108 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-13 23:36:02,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:36:02,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:02,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:02,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 23:36:02,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 23:36:04,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:36:04,884 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:36:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229991240] [2024-11-13 23:36:04,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229991240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:36:04,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:36:04,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:36:04,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786158393] [2024-11-13 23:36:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:36:04,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:36:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:36:04,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:36:04,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:36:04,889 INFO L87 Difference]: Start difference. First operand 105 states and 168 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 23:36:07,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:36:07,735 INFO L93 Difference]: Finished difference Result 303 states and 487 transitions. [2024-11-13 23:36:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:36:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 265 [2024-11-13 23:36:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:36:07,742 INFO L225 Difference]: With dead ends: 303 [2024-11-13 23:36:07,743 INFO L226 Difference]: Without dead ends: 201 [2024-11-13 23:36:07,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 263 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-13 23:36:07,751 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 42 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 23:36:07,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 306 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 23:36:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-13 23:36:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-11-13 23:36:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 108 states have (on average 1.3148148148148149) internal successors, (142), 108 states have internal predecessors, (142), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 23:36:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 318 transitions. [2024-11-13 23:36:07,860 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 318 transitions. Word has length 265 [2024-11-13 23:36:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:36:07,862 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 318 transitions. [2024-11-13 23:36:07,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 23:36:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 318 transitions. [2024-11-13 23:36:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 23:36:07,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:36:07,877 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:36:07,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 23:36:08,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:08,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:36:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:36:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1161127395, now seen corresponding path program 1 times [2024-11-13 23:36:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:36:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186592589] [2024-11-13 23:36:08,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:08,081 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-13 23:36:08,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:36:08,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:08,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:08,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:36:08,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 23:36:10,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:36:10,794 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:36:10,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186592589] [2024-11-13 23:36:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186592589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:36:10,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:36:10,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:36:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171463063] [2024-11-13 23:36:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:36:10,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:36:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:36:10,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:36:10,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:36:10,798 INFO L87 Difference]: Start difference. First operand 199 states and 318 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 23:36:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:36:12,745 INFO L93 Difference]: Finished difference Result 659 states and 1053 transitions. [2024-11-13 23:36:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:36:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2024-11-13 23:36:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:36:12,757 INFO L225 Difference]: With dead ends: 659 [2024-11-13 23:36:12,757 INFO L226 Difference]: Without dead ends: 463 [2024-11-13 23:36:12,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:36:12,760 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 198 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 23:36:12,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 381 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 23:36:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-13 23:36:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 369. [2024-11-13 23:36:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 188 states have (on average 1.25) internal successors, (235), 188 states have internal predecessors, (235), 176 states have call successors, (176), 4 states have call predecessors, (176), 4 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-13 23:36:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 587 transitions. [2024-11-13 23:36:12,869 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 587 transitions. Word has length 266 [2024-11-13 23:36:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:36:12,871 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 587 transitions. [2024-11-13 23:36:12,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 23:36:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 587 transitions. [2024-11-13 23:36:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 23:36:12,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:36:12,877 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:36:12,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:13,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:13,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:36:13,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:36:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash -902961957, now seen corresponding path program 1 times [2024-11-13 23:36:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:36:13,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823851193] [2024-11-13 23:36:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:13,079 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-13 23:36:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:36:13,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:13,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:13,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:36:13,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-11-13 23:36:14,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:36:14,488 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:36:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823851193] [2024-11-13 23:36:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823851193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:36:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1956072475] [2024-11-13 23:36:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:36:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:36:14,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:36:14,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-13 23:36:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:15,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 23:36:15,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 23:36:16,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:36:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1956072475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:36:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:36:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-13 23:36:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796896206] [2024-11-13 23:36:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:36:16,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:36:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:36:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:36:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:36:16,099 INFO L87 Difference]: Start difference. First operand 369 states and 587 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 23:36:17,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:36:19,747 INFO L93 Difference]: Finished difference Result 1095 states and 1743 transitions. [2024-11-13 23:36:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:36:19,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2024-11-13 23:36:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:36:19,760 INFO L225 Difference]: With dead ends: 1095 [2024-11-13 23:36:19,760 INFO L226 Difference]: Without dead ends: 729 [2024-11-13 23:36:19,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:36:19,764 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 154 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:36:19,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 459 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-13 23:36:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-13 23:36:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2024-11-13 23:36:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 366 states have (on average 1.2131147540983607) internal successors, (444), 366 states have internal predecessors, (444), 352 states have call successors, (352), 8 states have call predecessors, (352), 8 states have return successors, (352), 352 states have call predecessors, (352), 352 states have call successors, (352) [2024-11-13 23:36:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1148 transitions. [2024-11-13 23:36:19,863 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1148 transitions. Word has length 266 [2024-11-13 23:36:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:36:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1148 transitions. [2024-11-13 23:36:19,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 23:36:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1148 transitions. [2024-11-13 23:36:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 23:36:19,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:36:19,871 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:36:19,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:36:20,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-13 23:36:20,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:36:20,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:36:20,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:36:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash 872045405, now seen corresponding path program 1 times [2024-11-13 23:36:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:36:20,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496884815] [2024-11-13 23:36:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:20,273 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-13 23:36:20,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:36:20,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:20,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 23:36:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:20,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:36:20,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-11-13 23:36:21,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:36:21,693 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:36:21,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496884815] [2024-11-13 23:36:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496884815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:36:21,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [504306392] [2024-11-13 23:36:21,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:21,694 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:36:21,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:36:21,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:36:21,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-13 23:36:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:23,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:36:23,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1863 proven. 51 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2024-11-13 23:36:28,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:36:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 23:36:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [504306392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:36:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601126727] [2024-11-13 23:36:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:29,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:36:29,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:36:29,600 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:36:29,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 23:36:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:30,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:36:30,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-11-13 23:36:30,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:36:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601126727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:36:30,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2024-11-13 23:36:30,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 5] total 11 [2024-11-13 23:36:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917658781] [2024-11-13 23:36:30,691 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2024-11-13 23:36:30,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:36:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:36:30,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:36:30,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:36:30,694 INFO L87 Difference]: Start difference. First operand 727 states and 1148 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 4 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (83), 4 states have call predecessors, (83), 4 states have call successors, (83) [2024-11-13 23:36:41,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:36:52,087 INFO L93 Difference]: Finished difference Result 1943 states and 2982 transitions. [2024-11-13 23:36:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 23:36:52,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 4 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (83), 4 states have call predecessors, (83), 4 states have call successors, (83) Word has length 266 [2024-11-13 23:36:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:36:52,104 INFO L225 Difference]: With dead ends: 1943 [2024-11-13 23:36:52,104 INFO L226 Difference]: Without dead ends: 1219 [2024-11-13 23:36:52,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1093 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-11-13 23:36:52,111 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 572 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:36:52,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 501 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 17.1s Time] [2024-11-13 23:36:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-13 23:36:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 795. [2024-11-13 23:36:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 418 states have (on average 1.1818181818181819) internal successors, (494), 418 states have internal predecessors, (494), 352 states have call successors, (352), 24 states have call predecessors, (352), 24 states have return successors, (352), 352 states have call predecessors, (352), 352 states have call successors, (352) [2024-11-13 23:36:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1198 transitions. [2024-11-13 23:36:52,291 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1198 transitions. Word has length 266 [2024-11-13 23:36:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:36:52,292 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1198 transitions. [2024-11-13 23:36:52,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 4 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (83), 4 states have call predecessors, (83), 4 states have call successors, (83) [2024-11-13 23:36:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1198 transitions. [2024-11-13 23:36:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-13 23:36:52,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:36:52,296 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:36:52,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 23:36:52,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-13 23:36:52,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 23:36:52,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:36:52,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:36:52,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:36:52,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1033002595, now seen corresponding path program 1 times [2024-11-13 23:36:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:36:52,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028601618] [2024-11-13 23:36:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:52,899 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-13 23:36:52,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:36:52,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:36:52,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-13 23:36:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:53,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 23:36:53,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:37:27,618 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from false [2024-11-13 23:37:29,646 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-13 23:37:38,465 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-13 23:37:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1935 proven. 144 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2024-11-13 23:37:43,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:39:14,882 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:39:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028601618] [2024-11-13 23:39:14,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028601618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:14,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [936346562] [2024-11-13 23:39:14,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:14,883 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:39:14,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:39:14,886 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:39:14,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-13 23:39:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:17,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:39:17,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1935 proven. 144 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2024-11-13 23:40:07,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:41:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [936346562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:41:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591719103] [2024-11-13 23:41:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:41:11,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:41:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:41:11,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:41:11,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 23:41:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:41:12,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 23:41:12,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:41:39,451 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (fp.geq ~var_1_26~0 .cse1) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (fp.geq ~var_1_26~0 .cse1) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1)))))) is different from true [2024-11-13 23:41:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1979 proven. 99 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2024-11-13 23:41:48,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:42:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591719103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:42:20,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:42:20,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 15 [2024-11-13 23:42:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566895527] [2024-11-13 23:42:20,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:42:20,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 23:42:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:42:20,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 23:42:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=201, Unknown=18, NotChecked=96, Total=380 [2024-11-13 23:42:20,150 INFO L87 Difference]: Start difference. First operand 795 states and 1198 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-11-13 23:42:44,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3)) (.cse4 (fp.neg .cse7)) (.cse5 (fp.neg .cse6))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5)))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (let ((.cse8 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse6))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (fp.leq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse4))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 23:42:46,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (and (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))))) is different from false [2024-11-13 23:42:48,623 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (and (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))))) is different from true [2024-11-13 23:42:51,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:42:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:53,677 INFO L93 Difference]: Finished difference Result 2029 states and 3037 transitions. [2024-11-13 23:42:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 23:42:53,682 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) Word has length 267 [2024-11-13 23:42:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:53,692 INFO L225 Difference]: With dead ends: 2029 [2024-11-13 23:42:53,692 INFO L226 Difference]: Without dead ends: 1237 [2024-11-13 23:42:53,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 1019 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 98.9s TimeCoverageRelationStatistics Valid=104, Invalid=266, Unknown=30, NotChecked=200, Total=600 [2024-11-13 23:42:53,697 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 80 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1064 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:53,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 742 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 535 Invalid, 0 Unknown, 1064 Unchecked, 8.5s Time] [2024-11-13 23:42:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-13 23:42:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1225. [2024-11-13 23:42:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 652 states have (on average 1.1855828220858895) internal successors, (773), 652 states have internal predecessors, (773), 528 states have call successors, (528), 44 states have call predecessors, (528), 44 states have return successors, (528), 528 states have call predecessors, (528), 528 states have call successors, (528) [2024-11-13 23:42:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1829 transitions. [2024-11-13 23:42:53,899 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1829 transitions. Word has length 267 [2024-11-13 23:42:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:53,902 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1829 transitions. [2024-11-13 23:42:53,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-11-13 23:42:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1829 transitions. [2024-11-13 23:42:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-13 23:42:53,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:53,905 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:53,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 23:42:54,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-13 23:42:54,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-13 23:42:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:42:54,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:54,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1713060965, now seen corresponding path program 1 times [2024-11-13 23:42:54,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:42:54,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379336669] [2024-11-13 23:42:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:54,508 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-13 23:42:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:42:54,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:42:54,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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 (13)] Waiting until timeout for monitored process [2024-11-13 23:42:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:55,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 23:42:55,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:26,998 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-13 23:43:36,100 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-13 23:43:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1935 proven. 144 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2024-11-13 23:43:40,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:45:03,969 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:45:03,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379336669] [2024-11-13 23:45:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379336669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:45:03,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [997486702] [2024-11-13 23:45:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:45:03,969 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:45:03,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:45:03,971 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:45:03,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-13 23:45:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:45:05,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:45:05,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:45:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1935 proven. 144 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2024-11-13 23:45:42,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:46:35,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [997486702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:46:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857616562] [2024-11-13 23:46:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:46:35,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:46:35,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:46:35,618 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:46:35,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 23:46:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:46:36,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 23:46:36,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:47:06,070 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (fp.geq ~var_1_26~0 .cse1) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (fp.geq ~var_1_26~0 .cse1) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1)))))) is different from true [2024-11-13 23:47:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1979 proven. 99 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2024-11-13 23:47:14,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:47:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857616562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:47:43,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:47:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 15 [2024-11-13 23:47:43,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932065921] [2024-11-13 23:47:43,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:47:43,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 23:47:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:47:43,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 23:47:43,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=199, Unknown=20, NotChecked=96, Total=380 [2024-11-13 23:47:43,930 INFO L87 Difference]: Start difference. First operand 1225 states and 1829 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-11-13 23:48:07,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3)) (.cse4 (fp.neg .cse7)) (.cse5 (fp.neg .cse6))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5)))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (let ((.cse8 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse6))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (fp.leq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse4))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 23:48:09,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (and (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))))) is different from false [2024-11-13 23:48:11,991 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (and (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))))) is different from true [2024-11-13 23:48:16,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:48:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:48:19,313 INFO L93 Difference]: Finished difference Result 2029 states and 3037 transitions. [2024-11-13 23:48:19,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 23:48:19,319 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) Word has length 267 [2024-11-13 23:48:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:48:19,332 INFO L225 Difference]: With dead ends: 2029 [2024-11-13 23:48:19,332 INFO L226 Difference]: Without dead ends: 1237 [2024-11-13 23:48:19,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 1019 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 98.1s TimeCoverageRelationStatistics Valid=104, Invalid=264, Unknown=32, NotChecked=200, Total=600 [2024-11-13 23:48:19,338 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 80 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1064 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:48:19,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 801 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 433 Invalid, 0 Unknown, 1064 Unchecked, 10.4s Time] [2024-11-13 23:48:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-13 23:48:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1223. [2024-11-13 23:48:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 650 states have (on average 1.1830769230769231) internal successors, (769), 650 states have internal predecessors, (769), 528 states have call successors, (528), 44 states have call predecessors, (528), 44 states have return successors, (528), 528 states have call predecessors, (528), 528 states have call successors, (528) [2024-11-13 23:48:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1825 transitions. [2024-11-13 23:48:19,561 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1825 transitions. Word has length 267 [2024-11-13 23:48:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:48:19,563 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1825 transitions. [2024-11-13 23:48:19,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-11-13 23:48:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1825 transitions. [2024-11-13 23:48:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 23:48:19,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:48:19,565 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:48:19,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-13 23:48:19,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 23:48:19,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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 (13)] Ended with exit code 0 [2024-11-13 23:48:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:48:20,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:48:20,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:48:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1447829977, now seen corresponding path program 1 times [2024-11-13 23:48:20,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:48:20,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971788362] [2024-11-13 23:48:20,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:20,168 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-13 23:48:20,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:48:20,170 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:48:20,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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 (16)] Waiting until timeout for monitored process [2024-11-13 23:48:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:20,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:48:20,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 213 proven. 126 refuted. 0 times theorem prover too weak. 3445 trivial. 0 not checked. [2024-11-13 23:48:22,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:48:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 3 proven. 126 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 23:48:23,182 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:48:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971788362] [2024-11-13 23:48:23,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971788362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:48:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1076769068] [2024-11-13 23:48:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:23,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:48:23,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:48:23,185 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:48:23,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-13 23:48:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:24,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 23:48:24,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 213 proven. 126 refuted. 0 times theorem prover too weak. 3445 trivial. 0 not checked. [2024-11-13 23:48:26,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:48:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 3 proven. 126 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 23:48:27,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1076769068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:48:27,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789810147] [2024-11-13 23:48:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:27,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:48:27,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:48:27,336 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:48:27,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 23:48:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:27,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:48:27,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 213 proven. 126 refuted. 0 times theorem prover too weak. 3445 trivial. 0 not checked. [2024-11-13 23:48:28,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:48:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 3 proven. 126 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 23:48:29,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789810147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:48:29,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-13 23:48:29,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 8 [2024-11-13 23:48:29,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292620313] [2024-11-13 23:48:29,990 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-13 23:48:29,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:48:29,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:48:29,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:48:29,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:48:29,993 INFO L87 Difference]: Start difference. First operand 1223 states and 1825 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2024-11-13 23:48:32,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:48:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:48:33,192 INFO L93 Difference]: Finished difference Result 2266 states and 3339 transitions. [2024-11-13 23:48:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 23:48:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) Word has length 268 [2024-11-13 23:48:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:48:33,212 INFO L225 Difference]: With dead ends: 2266 [2024-11-13 23:48:33,212 INFO L226 Difference]: Without dead ends: 1046 [2024-11-13 23:48:33,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1614 GetRequests, 1594 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-13 23:48:33,219 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 189 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:48:33,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 388 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 23:48:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-13 23:48:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 979. [2024-11-13 23:48:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 540 states have (on average 1.1851851851851851) internal successors, (640), 540 states have internal predecessors, (640), 396 states have call successors, (396), 42 states have call predecessors, (396), 42 states have return successors, (396), 396 states have call predecessors, (396), 396 states have call successors, (396) [2024-11-13 23:48:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1432 transitions. [2024-11-13 23:48:33,420 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1432 transitions. Word has length 268 [2024-11-13 23:48:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:48:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1432 transitions. [2024-11-13 23:48:33,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2024-11-13 23:48:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1432 transitions. [2024-11-13 23:48:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 23:48:33,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:48:33,424 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:48:33,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 23:48:33,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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 (16)] Ended with exit code 0 [2024-11-13 23:48:33,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-13 23:48:34,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:48:34,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:48:34,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:48:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1390571675, now seen corresponding path program 1 times [2024-11-13 23:48:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:48:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197714777] [2024-11-13 23:48:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:34,026 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-13 23:48:34,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:48:34,028 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:48:34,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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 (19)] Waiting until timeout for monitored process [2024-11-13 23:48:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:34,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 23:48:34,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 418 proven. 240 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2024-11-13 23:48:37,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:48:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 6 proven. 123 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 23:48:38,194 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:48:38,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197714777] [2024-11-13 23:48:38,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197714777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:48:38,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1388776755] [2024-11-13 23:48:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:38,194 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:48:38,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:48:38,199 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:48:38,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-13 23:48:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:38,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:48:38,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 23:48:38,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:48:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1388776755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:48:38,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 23:48:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 6] total 14 [2024-11-13 23:48:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545882818] [2024-11-13 23:48:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:48:38,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:48:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:48:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:48:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:48:38,968 INFO L87 Difference]: Start difference. First operand 979 states and 1432 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 23:48:40,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:48:42,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:48:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:48:42,868 INFO L93 Difference]: Finished difference Result 2056 states and 2998 transitions. [2024-11-13 23:48:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:48:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 268 [2024-11-13 23:48:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:48:42,879 INFO L225 Difference]: With dead ends: 2056 [2024-11-13 23:48:42,880 INFO L226 Difference]: Without dead ends: 1080 [2024-11-13 23:48:42,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 789 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:48:42,891 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 204 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-13 23:48:42,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 473 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-13 23:48:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-13 23:48:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 985. [2024-11-13 23:48:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 546 states have (on average 1.1904761904761905) internal successors, (650), 546 states have internal predecessors, (650), 396 states have call successors, (396), 42 states have call predecessors, (396), 42 states have return successors, (396), 396 states have call predecessors, (396), 396 states have call successors, (396) [2024-11-13 23:48:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1442 transitions. [2024-11-13 23:48:43,117 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1442 transitions. Word has length 268 [2024-11-13 23:48:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:48:43,118 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1442 transitions. [2024-11-13 23:48:43,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 23:48:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1442 transitions. [2024-11-13 23:48:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 23:48:43,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:48:43,121 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:48:43,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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 (19)] Ended with exit code 0 [2024-11-13 23:48:43,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-13 23:48:43,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:48:43,523 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:48:43,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:48:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2095048995, now seen corresponding path program 1 times [2024-11-13 23:48:43,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:48:43,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255754131] [2024-11-13 23:48:43,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:43,525 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-13 23:48:43,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:48:43,527 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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-13 23:48:43,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da0390ac-9045-4737-906a-7551b386c16c/bin/utaipan-verify-sOmjnqqW8E/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 (21)] Waiting until timeout for monitored process [2024-11-13 23:48:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:43,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 23:48:44,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:21,270 WARN L286 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:49:48,098 WARN L286 SmtUtils]: Spent 10.78s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:50:33,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 24) c_~var_1_15~0)) (.cse2 ((_ sign_extend 16) c_~var_1_22~0)) (.cse0 ((_ sign_extend 16) c_~var_1_10~0)) (.cse4 ((_ zero_extend 24) c_~var_1_7~0))) (and (= ((_ extract 15 0) (bvadd (bvneg (bvadd (_ bv2 32) .cse0)) ((_ sign_extend 16) c_~var_1_9~0))) c_~var_1_8~0) (= c_~var_1_27~0 .cse1) (= (_ bv0 8) c_~var_1_18~0) (not (= ((_ sign_extend 24) c_~var_1_12~0) .cse2)) (not (bvuge .cse1 (bvudiv c_~var_1_27~0 ((_ sign_extend 24) c_~var_1_19~0)))) (let ((.cse3 (fp.gt c_~var_1_25~0 c_~var_1_26~0))) (or (and (= (fp.add c_currentRoundingMode c_~var_1_24~0 c_~var_1_25~0) c_~var_1_23~0) .cse3) (and (not .cse3) (= (fp.add c_currentRoundingMode c_~var_1_24~0 c_~var_1_26~0) c_~var_1_23~0)))) (bvsle .cse4 (_ bv1 32)) (= c_~var_1_20~0 ((_ extract 15 0) (bvadd (bvneg (bvadd ((_ sign_extend 24) c_~var_1_16~0) .cse1)) .cse2 (bvneg .cse0)))) (bvsge .cse4 (_ bv1 32)) (fp.gt ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~var_1_23~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 8.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_23~0))))) is different from false