./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 8920271114188d3ea569925fb7a99f78f49c1ab5edfd793b8aed7395cbd29159 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:01:19,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:01:19,843 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:01:19,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:01:19,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:01:19,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:01:19,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:01:19,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:01:19,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:01:19,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:01:19,893 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:01:19,893 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:01:19,893 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:01:19,893 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:01:19,893 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:01:19,894 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:01:19,894 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:01:19,894 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:01:19,894 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:01:19,894 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:01:19,894 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:01:19,894 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:01:19,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:01:19,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:01:19,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:01:19,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:01:19,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:01:19,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:01:19,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:01:19,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:01:19,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:01:19,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:01:19,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:01:19,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:01:19,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:01:19,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:01:19,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:01:19,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:01:19,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:01:19,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:01:19,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:01:19,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:01:19,897 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:01:19,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:01:19,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:01:19,897 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:01:19,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:01:19,897 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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 -> 8920271114188d3ea569925fb7a99f78f49c1ab5edfd793b8aed7395cbd29159 [2024-11-14 04:01:20,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:01:20,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:01:20,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:01:20,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:01:20,288 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:01:20,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i Unable to find full path for "g++" [2024-11-14 04:01:22,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:01:22,635 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:01:22,636 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-14 04:01:22,647 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/data/26cae88b5/ca911f6e951e4398b791da73dd19181c/FLAGdb9c6fff4 [2024-11-14 04:01:22,864 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/data/26cae88b5/ca911f6e951e4398b791da73dd19181c [2024-11-14 04:01:22,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:01:22,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:01:22,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:01:22,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:01:22,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:01:22,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:01:22" (1/1) ... [2024-11-14 04:01:22,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82fba61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:22, skipping insertion in model container [2024-11-14 04:01:22,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:01:22" (1/1) ... [2024-11-14 04:01:22,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:01:23,092 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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2024-11-14 04:01:23,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:01:23,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:01:23,208 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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2024-11-14 04:01:23,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:01:23,305 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:01:23,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23 WrapperNode [2024-11-14 04:01:23,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:01:23,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:01:23,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:01:23,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:01:23,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,395 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-14 04:01:23,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:01:23,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:01:23,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:01:23,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:01:23,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:01:23,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:01:23,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:01:23,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:01:23,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (1/1) ... [2024-11-14 04:01:23,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:01:23,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:23,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:01:23,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:01:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:01:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:01:23,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:01:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:01:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:01:23,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:01:23,666 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:01:23,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:01:24,199 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-14 04:01:24,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:01:24,550 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:01:24,552 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:01:24,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:01:24 BoogieIcfgContainer [2024-11-14 04:01:24,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:01:24,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:01:24,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:01:24,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:01:24,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:01:22" (1/3) ... [2024-11-14 04:01:24,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195ef5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:01:24, skipping insertion in model container [2024-11-14 04:01:24,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:23" (2/3) ... [2024-11-14 04:01:24,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195ef5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:01:24, skipping insertion in model container [2024-11-14 04:01:24,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:01:24" (3/3) ... [2024-11-14 04:01:24,567 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-14 04:01:24,585 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:01:24,588 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:01:24,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:01:24,688 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;@1be99a25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:01:24,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:01:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-14 04:01:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-14 04:01:24,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:24,712 INFO L215 NwaCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:01:24,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:01:24,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1529530454, now seen corresponding path program 1 times [2024-11-14 04:01:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:01:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030847958] [2024-11-14 04:01:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:01:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 04:01:25,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408967031] [2024-11-14 04:01:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:25,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:25,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:25,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:01:25,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:01:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:01:26,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:01:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:01:26,547 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:01:26,549 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:01:26,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:01:26,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 04:01:26,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 04:01:26,763 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 04:01:26,921 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:01:26,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:01:26 BoogieIcfgContainer [2024-11-14 04:01:26,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:01:26,925 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:01:26,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:01:26,926 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:01:26,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:01:24" (3/4) ... [2024-11-14 04:01:26,929 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:01:26,929 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:01:26,930 INFO L158 Benchmark]: Toolchain (without parser) took 4062.06ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 50.0MB in the end (delta: 44.3MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2024-11-14 04:01:26,931 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:01:26,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.47ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 79.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:01:26,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.90ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 77.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:01:26,932 INFO L158 Benchmark]: Boogie Preprocessor took 61.43ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:01:26,932 INFO L158 Benchmark]: RCFGBuilder took 1095.04ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 69.9MB in the end (delta: 5.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-11-14 04:01:26,933 INFO L158 Benchmark]: TraceAbstraction took 2369.27ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 50.0MB in the end (delta: 19.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-14 04:01:26,933 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 117.4MB. Free memory was 50.0MB in the beginning and 50.0MB in the end (delta: 11.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:01:26,937 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.04ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.47ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 79.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.90ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 77.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.43ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1095.04ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 69.9MB in the end (delta: 5.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2369.27ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 50.0MB in the end (delta: 19.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 117.4MB. Free memory was 50.0MB in the beginning and 50.0MB in the end (delta: 11.7kB). 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 178, overapproximation of someBinaryFLOATComparisonOperation at line 176, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of bitwiseOr at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryArithmeticFLOAToperation at line 93. 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] signed short int var_1_31 = 10; [L46] float var_1_39 = 4.7; [L47] unsigned short int var_1_40 = 100; [L48] signed short int var_1_41 = 4; [L49] float var_1_45 = 31.6; [L50] unsigned short int var_1_47 = 64; [L51] double var_1_48 = 16.75; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L138] var_1_6 = __VERIFIER_nondet_uchar() [L139] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, 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) [L139] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L140] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, 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) [L140] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, 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] [L141] var_1_7 = __VERIFIER_nondet_uchar() [L142] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) [L142] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L143] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) [L143] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L144] var_1_9 = __VERIFIER_nondet_short() [L145] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L145] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L146] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L146] 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L147] var_1_10 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L148] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=16320, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L149] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L149] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=16320, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L150] var_1_12 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L151] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L152] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L152] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L153] var_1_13 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L154] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L155] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L155] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L156] var_1_14 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L157] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L158] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L158] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L159] var_1_15 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L160] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L161] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L161] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L162] var_1_16 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L164] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L164] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L165] var_1_17 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L166] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L167] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L167] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L168] var_1_19 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L169] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L170] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L170] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L171] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L171] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L172] var_1_22 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L173] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L174] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L174] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] 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=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L176] 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=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, 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_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] 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=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L178] 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=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L179] var_1_26 = __VERIFIER_nondet_float() [L180] 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=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L20] COND FALSE !(!cond) [L180] 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=16320, var_1_11=1, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L193] RET updateVariables() [L194] CALL step() [L55] var_1_29 = var_1_26 [L56] COND TRUE var_1_7 && var_1_7 [L57] var_1_31 = ((((((((var_1_15 - var_1_10)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_15 - var_1_10)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) < 0 ) ? -(((((var_1_15 - var_1_10)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_15 - var_1_10)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) : (((((var_1_15 - var_1_10)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_15 - var_1_10)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))))) [L67] COND TRUE var_1_23 < var_1_24 [L68] COND FALSE !(var_1_16 > var_1_22) [L74] var_1_40 = var_1_15 [L75] COND FALSE !(\read(var_1_1)) [L82] EXPR var_1_15 | var_1_15 [L82] COND TRUE var_1_10 > (var_1_15 | var_1_15) [L83] COND FALSE !(((1u ^ var_1_15) / var_1_22) > (var_1_17 / var_1_22)) [L86] var_1_41 = var_1_17 [L92] COND TRUE var_1_1 || var_1_7 [L93] var_1_45 = (10.125f + var_1_24) [L95] var_1_47 = var_1_15 [L96] var_1_48 = var_1_25 [L97] var_1_8 = (var_1_9 - (2 + var_1_10)) [L98] COND TRUE var_1_22 != var_1_12 [L99] COND FALSE !(var_1_10 <= var_1_17) [L105] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L106] var_1_27 = var_1_15 [L108] COND TRUE var_1_23 == var_1_23 [L109] COND TRUE var_1_15 >= (var_1_27 / var_1_19) [L110] var_1_18 = var_1_7 [L113] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L114] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) [L118] COND TRUE \read(var_1_18) [L119] var_1_1 = (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6) [L123] COND FALSE !(\read(var_1_1)) [L126] COND TRUE var_1_27 >= var_1_14 [L127] var_1_11 = ((var_1_15 + var_1_16) - var_1_17) [L194] RET step() [L195] CALL, EXPR property() [L185-L186] 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) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=16320, var_1_11=62, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=0, var_1_20=-1, var_1_22=16382, var_1_23=158/5, var_1_24=0, var_1_25=2, var_1_26=3, var_1_27=0, var_1_29=3, var_1_31=16322, var_1_39=47/10, var_1_40=0, var_1_41=1, var_1_45=0, var_1_47=0, var_1_48=2, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] [L19] reach_error() VAL [isInitial=1, var_1_10=16320, var_1_11=62, var_1_12=63, var_1_13=-63, var_1_14=0, var_1_15=0, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=0, var_1_20=-1, var_1_22=16382, var_1_23=158/5, var_1_24=0, var_1_25=2, var_1_26=3, var_1_27=0, var_1_29=3, var_1_31=16322, var_1_39=47/10, var_1_40=0, var_1_41=1, var_1_45=0, var_1_47=0, var_1_48=2, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=16322] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 1, TraceHistogramMax: 28, 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=52occurred 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, 1.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 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-14 04:01:26,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 8920271114188d3ea569925fb7a99f78f49c1ab5edfd793b8aed7395cbd29159 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:01:30,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:01:30,250 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 04:01:30,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:01:30,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:01:30,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:01:30,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:01:30,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:01:30,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:01:30,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:01:30,320 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:01:30,321 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:01:30,321 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:01:30,321 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:01:30,321 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:01:30,321 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:01:30,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:01:30,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:01:30,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:01:30,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:01:30,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:01:30,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:01:30,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:01:30,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:01:30,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:01:30,323 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:01:30,323 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:01:30,324 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:01:30,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:01:30,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:01:30,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:01:30,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:01:30,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:01:30,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:01:30,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:01:30,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:01:30,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:01:30,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:01:30,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:01:30,326 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:01:30,326 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:30,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:01:30,326 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:01:30,326 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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 -> 8920271114188d3ea569925fb7a99f78f49c1ab5edfd793b8aed7395cbd29159 [2024-11-14 04:01:30,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:01:30,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:01:30,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:01:30,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:01:30,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:01:30,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i Unable to find full path for "g++" [2024-11-14 04:01:32,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:01:33,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:01:33,204 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-14 04:01:33,214 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/data/223d1db6d/be662361c3514ebeb1460c812c9b51d2/FLAG53bd60f59 [2024-11-14 04:01:33,456 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/data/223d1db6d/be662361c3514ebeb1460c812c9b51d2 [2024-11-14 04:01:33,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:01:33,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:01:33,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:01:33,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:01:33,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:01:33,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:33,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9cede1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33, skipping insertion in model container [2024-11-14 04:01:33,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:33,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:01:33,671 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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2024-11-14 04:01:33,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:01:33,820 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:01:33,831 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_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2024-11-14 04:01:33,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:01:33,904 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:01:33,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33 WrapperNode [2024-11-14 04:01:33,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:01:33,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:01:33,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:01:33,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:01:33,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:33,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:33,961 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-14 04:01:33,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:01:33,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:01:33,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:01:33,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:01:33,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:33,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:33,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:33,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:34,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:34,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:34,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:34,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:34,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:01:34,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:01:34,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:01:34,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:01:34,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (1/1) ... [2024-11-14 04:01:34,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:01:34,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:34,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:01:34,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:01:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:01:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:01:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:01:34,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:01:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:01:34,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:01:34,229 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:01:34,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:01:37,182 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-14 04:01:37,182 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:01:37,197 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:01:37,197 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:01:37,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:01:37 BoogieIcfgContainer [2024-11-14 04:01:37,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:01:37,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:01:37,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:01:37,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:01:37,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:01:33" (1/3) ... [2024-11-14 04:01:37,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57394aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:01:37, skipping insertion in model container [2024-11-14 04:01:37,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:33" (2/3) ... [2024-11-14 04:01:37,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57394aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:01:37, skipping insertion in model container [2024-11-14 04:01:37,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:01:37" (3/3) ... [2024-11-14 04:01:37,209 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-14 04:01:37,227 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:01:37,229 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:01:37,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:01:37,313 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;@86f180a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:01:37,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:01:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-14 04:01:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-14 04:01:37,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:37,339 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:01:37,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:01:37,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash 599367623, now seen corresponding path program 1 times [2024-11-14 04:01:37,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:37,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306993167] [2024-11-14 04:01:37,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:37,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:37,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:01:37,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:01:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:38,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:01:38,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-14 04:01:38,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:38,752 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:38,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306993167] [2024-11-14 04:01:38,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306993167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:01:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [477550004] [2024-11-14 04:01:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:38,753 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:38,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:38,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:38,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-14 04:01:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:39,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:01:39,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-14 04:01:40,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:01:40,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [477550004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:40,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:01:40,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-14 04:01:40,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240755760] [2024-11-14 04:01:40,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:40,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:01:40,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:40,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:01:40,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:01:40,358 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-14 04:01:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:41,236 INFO L93 Difference]: Finished difference Result 241 states and 452 transitions. [2024-11-14 04:01:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:01:41,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-14 04:01:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:41,276 INFO L225 Difference]: With dead ends: 241 [2024-11-14 04:01:41,277 INFO L226 Difference]: Without dead ends: 159 [2024-11-14 04:01:41,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 366 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-14 04:01:41,288 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 36 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:41,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 247 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:01:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-14 04:01:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-14 04:01:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-14 04:01:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 251 transitions. [2024-11-14 04:01:41,400 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 251 transitions. Word has length 177 [2024-11-14 04:01:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:41,406 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 251 transitions. [2024-11-14 04:01:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-14 04:01:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 251 transitions. [2024-11-14 04:01:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-14 04:01:41,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:41,412 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:01:41,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:01:41,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-14 04:01:41,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:41,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:01:41,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash 656625925, now seen corresponding path program 1 times [2024-11-14 04:01:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:41,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572691015] [2024-11-14 04:01:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:41,815 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-14 04:01:41,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:41,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:01:41,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:01:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:42,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:01:42,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-14 04:01:42,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:42,750 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:42,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572691015] [2024-11-14 04:01:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572691015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:01:42,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [233120517] [2024-11-14 04:01:42,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:42,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:42,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:42,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:42,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-14 04:01:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:44,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:01:44,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-14 04:01:44,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:01:44,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [233120517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:44,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:01:44,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-14 04:01:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689006243] [2024-11-14 04:01:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:44,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:01:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:01:44,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:01:44,390 INFO L87 Difference]: Start difference. First operand 157 states and 251 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-14 04:01:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:46,385 INFO L93 Difference]: Finished difference Result 461 states and 739 transitions. [2024-11-14 04:01:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:01:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-14 04:01:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:46,396 INFO L225 Difference]: With dead ends: 461 [2024-11-14 04:01:46,399 INFO L226 Difference]: Without dead ends: 307 [2024-11-14 04:01:46,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 366 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-14 04:01:46,402 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 114 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:46,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 340 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 04:01:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-14 04:01:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2024-11-14 04:01:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 188 states have (on average 1.372340425531915) internal successors, (258), 188 states have internal predecessors, (258), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-14 04:01:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 482 transitions. [2024-11-14 04:01:46,495 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 482 transitions. Word has length 177 [2024-11-14 04:01:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:46,497 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 482 transitions. [2024-11-14 04:01:46,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-14 04:01:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 482 transitions. [2024-11-14 04:01:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-14 04:01:46,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:46,507 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:01:46,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-14 04:01:46,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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)] Forceful destruction successful, exit code 0 [2024-11-14 04:01:46,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:01:46,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:01:46,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1863334009, now seen corresponding path program 1 times [2024-11-14 04:01:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:46,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941142080] [2024-11-14 04:01:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:46,913 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-14 04:01:46,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:46,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:01:46,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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)] Waiting until timeout for monitored process [2024-11-14 04:01:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:47,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:01:47,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-14 04:01:47,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:47,832 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:47,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941142080] [2024-11-14 04:01:47,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941142080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:01:47,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [713481286] [2024-11-14 04:01:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:47,837 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:47,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:47,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:47,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-14 04:01:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:49,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:01:49,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-14 04:01:50,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-14 04:01:51,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [713481286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610571939] [2024-11-14 04:01:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:51,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:51,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:51,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:01:51,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:01:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:51,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:01:51,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-14 04:01:51,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610571939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:01:51,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2024-11-14 04:01:51,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 5] total 11 [2024-11-14 04:01:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877723679] [2024-11-14 04:01:51,816 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2024-11-14 04:01:51,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 04:01:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 04:01:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:01:51,819 INFO L87 Difference]: Start difference. First operand 305 states and 482 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-14 04:02:02,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:02:03,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:02:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:02:10,053 INFO L93 Difference]: Finished difference Result 827 states and 1266 transitions. [2024-11-14 04:02:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 04:02:10,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 177 [2024-11-14 04:02:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:02:10,062 INFO L225 Difference]: With dead ends: 827 [2024-11-14 04:02:10,062 INFO L226 Difference]: Without dead ends: 525 [2024-11-14 04:02:10,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-11-14 04:02:10,066 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 322 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:02:10,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 460 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2024-11-14 04:02:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-14 04:02:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 341. [2024-11-14 04:02:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 216 states have (on average 1.3055555555555556) internal successors, (282), 216 states have internal predecessors, (282), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-14 04:02:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 506 transitions. [2024-11-14 04:02:10,171 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 506 transitions. Word has length 177 [2024-11-14 04:02:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:02:10,175 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 506 transitions. [2024-11-14 04:02:10,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-14 04:02:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 506 transitions. [2024-11-14 04:02:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-14 04:02:10,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:02:10,183 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:02:10,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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)] Forceful destruction successful, exit code 0 [2024-11-14 04:02:10,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-14 04:02:10,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 04:02:10,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:02:10,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:02:10,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:02:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2135586657, now seen corresponding path program 1 times [2024-11-14 04:02:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:02:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809760649] [2024-11-14 04:02:10,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:02:10,786 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-14 04:02:10,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:02:10,788 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:02:10,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 (9)] Waiting until timeout for monitored process [2024-11-14 04:02:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:02:11,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 04:02:11,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:29,597 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse5 (fp.neg .cse0)) (.cse4 (fp.neg .cse2))) (let ((.cse3 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4)))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0))))) (or (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) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) .cse3)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~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 .cse5) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))) (fp.leq ~var_1_25~0 .cse5))) (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) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse5))) (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 .cse2) (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)))) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~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) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~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 .cse0) (fp.leq ~var_1_25~0 .cse2) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))) .cse3)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~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 .cse2) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~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 .cse5) (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) (not (fp.lt .cse1 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse2) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))) (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 .cse0) (fp.leq ~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 .cse2) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~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 .cse2) (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) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse5))))))) is different from true [2024-11-14 04:02:36,409 WARN L851 $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 ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0)))) (.cse1 (fp.neg .cse3)) (.cse0 (fp.neg .cse2))) (or (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 (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.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.geq ~var_1_24~0 .cse3) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse0) (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))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= 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 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (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)))) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (= (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_24~0 .cse0))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (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 .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.geq ~var_1_24~0 .cse3) (not (fp.lt .cse4 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (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_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 .cse1) (fp.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (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 .cse1) (fp.geq ~var_1_24~0 .cse0))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (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 .cse3) (fp.leq ~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 .cse2) (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.geq ~var_1_24~0 .cse0)))))))) is different from false [2024-11-14 04:02:38,421 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 ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0)))) (.cse1 (fp.neg .cse3)) (.cse0 (fp.neg .cse2))) (or (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 (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.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.geq ~var_1_24~0 .cse3) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse0) (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))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= 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 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (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)))) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (= (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_24~0 .cse0))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (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 .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.geq ~var_1_24~0 .cse3) (not (fp.lt .cse4 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (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_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 .cse1) (fp.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (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 .cse1) (fp.geq ~var_1_24~0 .cse0))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (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 .cse3) (fp.leq ~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 .cse2) (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.geq ~var_1_24~0 .cse0)))))))) is different from true [2024-11-14 04:02:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-14 04:02:43,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:02:43,616 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:02:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809760649] [2024-11-14 04:02:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809760649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:02:43,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:02:43,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 04:02:43,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213952172] [2024-11-14 04:02:43,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:02:43,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 04:02:43,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:02:43,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 04:02:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=110, Unknown=3, NotChecked=46, Total=210 [2024-11-14 04:02:43,618 INFO L87 Difference]: Start difference. First operand 341 states and 506 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-14 04:03:40,069 WARN L286 SmtUtils]: Spent 39.17s on a formula simplification. DAG size of input: 116 DAG size of output: 246 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:04:24,879 WARN L286 SmtUtils]: Spent 31.87s on a formula simplification. DAG size of input: 108 DAG size of output: 223 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:04:26,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:29,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:36,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:37,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:41,398 INFO L93 Difference]: Finished difference Result 1247 states and 1848 transitions. [2024-11-14 04:04:41,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 04:04:41,399 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 178 [2024-11-14 04:04:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:41,407 INFO L225 Difference]: With dead ends: 1247 [2024-11-14 04:04:41,407 INFO L226 Difference]: Without dead ends: 909 [2024-11-14 04:04:41,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 106.8s TimeCoverageRelationStatistics Valid=143, Invalid=314, Unknown=13, NotChecked=82, Total=552 [2024-11-14 04:04:41,410 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 448 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 211 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 904 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:41,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 453 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 475 Invalid, 2 Unknown, 904 Unchecked, 19.2s Time] [2024-11-14 04:04:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-14 04:04:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 773. [2024-11-14 04:04:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 474 states have (on average 1.2890295358649788) internal successors, (611), 478 states have internal predecessors, (611), 268 states have call successors, (268), 30 states have call predecessors, (268), 30 states have return successors, (268), 264 states have call predecessors, (268), 268 states have call successors, (268) [2024-11-14 04:04:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1147 transitions. [2024-11-14 04:04:41,542 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1147 transitions. Word has length 178 [2024-11-14 04:04:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:41,543 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1147 transitions. [2024-11-14 04:04:41,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-14 04:04:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1147 transitions. [2024-11-14 04:04:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-14 04:04:41,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:41,546 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:04:41,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 (9)] Ended with exit code 0 [2024-11-14 04:04:41,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:04:41,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:04:41,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1479322269, now seen corresponding path program 1 times [2024-11-14 04:04:41,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:04:41,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491806152] [2024-11-14 04:04:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:41,748 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-14 04:04:41,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:04:41,750 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:04:41,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:04:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:42,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 04:04:42,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:05,105 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse5 (fp.neg .cse0)) (.cse4 (fp.neg .cse2))) (let ((.cse3 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4)))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0))))) (or (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) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) .cse3)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~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 .cse5) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))) (fp.leq ~var_1_25~0 .cse5))) (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) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse5))) (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 .cse2) (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)))) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~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) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~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 .cse0) (fp.leq ~var_1_25~0 .cse2) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))) .cse3)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~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 .cse2) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~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 .cse5) (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) (not (fp.lt .cse1 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse2) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))) (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 .cse0) (fp.leq ~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 .cse2) (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 .cse5) (fp.geq ~var_1_24~0 .cse4))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~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 .cse2) (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) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse5))))))) is different from true [2024-11-14 04:05:13,028 WARN L851 $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 ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0)))) (.cse1 (fp.neg .cse3)) (.cse0 (fp.neg .cse2))) (or (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 (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.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.geq ~var_1_24~0 .cse3) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse0) (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))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= 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 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (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)))) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (= (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_24~0 .cse0))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (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 .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.geq ~var_1_24~0 .cse3) (not (fp.lt .cse4 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (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_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 .cse1) (fp.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (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 .cse1) (fp.geq ~var_1_24~0 .cse0))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (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 .cse3) (fp.leq ~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 .cse2) (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.geq ~var_1_24~0 .cse0)))))))) is different from false [2024-11-14 04:05:15,034 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 ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0)))) (.cse1 (fp.neg .cse3)) (.cse0 (fp.neg .cse2))) (or (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 (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.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.geq ~var_1_24~0 .cse3) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse0) (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))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= 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 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (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)))) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (= (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_24~0 .cse0))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (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 .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.geq ~var_1_24~0 .cse3) (not (fp.lt .cse4 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (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_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 .cse1) (fp.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (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 .cse1) (fp.geq ~var_1_24~0 .cse0))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (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 .cse3) (fp.leq ~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 .cse2) (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.geq ~var_1_24~0 .cse0)))))))) is different from true [2024-11-14 04:05:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-14 04:05:19,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:05:19,608 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:05:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491806152] [2024-11-14 04:05:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491806152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:05:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:05:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 04:05:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197581000] [2024-11-14 04:05:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:05:19,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 04:05:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:05:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 04:05:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=110, Unknown=3, NotChecked=46, Total=210 [2024-11-14 04:05:19,610 INFO L87 Difference]: Start difference. First operand 773 states and 1147 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-14 04:05:25,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.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))) (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))) (not (fp.lt ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 158.0 5.0))) c_~var_1_24~0)) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse9 (fp.neg .cse4)) (.cse8 (fp.neg .cse6))) (let ((.cse7 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse9) (fp.geq ~var_1_26~0 .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse5 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse6) .cse7)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse8) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse9) (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 .cse9) (fp.geq ~var_1_24~0 .cse8))) (fp.leq ~var_1_25~0 .cse9))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse5 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse8) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse8) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse9))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (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)))) (not (fp.lt .cse5 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse6))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse5 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (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 .cse4) (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 .cse9) (fp.geq ~var_1_24~0 .cse8))) .cse7)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse8) (fp.leq ~var_1_25~0 .cse9) (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 .cse4) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse9) (fp.geq ~var_1_24~0 .cse8))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse8) (fp.leq ~var_1_25~0 .cse9) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse9) (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 .cse4) (not (fp.lt .cse5 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse8) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse8) (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 .cse9) (fp.geq ~var_1_24~0 .cse8))) (fp.leq ~var_1_25~0 .cse9))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (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 .cse9) (fp.geq ~var_1_24~0 .cse8))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (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 .cse4) (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 .cse9) (fp.geq ~var_1_24~0 .cse8))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse8) (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 .cse4) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (not (fp.lt .cse5 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse9))))))) (or (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))) (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))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-14 04:05:28,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:05:31,040 INFO L93 Difference]: Finished difference Result 1241 states and 1837 transitions. [2024-11-14 04:05:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 04:05:31,047 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 178 [2024-11-14 04:05:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:05:31,067 INFO L225 Difference]: With dead ends: 1241 [2024-11-14 04:05:31,071 INFO L226 Difference]: Without dead ends: 793 [2024-11-14 04:05:31,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=135, Invalid=253, Unknown=4, NotChecked=114, Total=506 [2024-11-14 04:05:31,074 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 271 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:05:31,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 508 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 437 Invalid, 0 Unknown, 766 Unchecked, 7.6s Time] [2024-11-14 04:05:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-14 04:05:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 661. [2024-11-14 04:05:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 416 states have (on average 1.3028846153846154) internal successors, (542), 418 states have internal predecessors, (542), 218 states have call successors, (218), 26 states have call predecessors, (218), 26 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2024-11-14 04:05:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 978 transitions. [2024-11-14 04:05:31,203 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 978 transitions. Word has length 178 [2024-11-14 04:05:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:05:31,204 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 978 transitions. [2024-11-14 04:05:31,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-14 04:05:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 978 transitions. [2024-11-14 04:05:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-14 04:05:31,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:05:31,207 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:05:31,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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)] Forceful destruction successful, exit code 0 [2024-11-14 04:05:31,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:05:31,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:05:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:05:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1627462447, now seen corresponding path program 1 times [2024-11-14 04:05:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:05:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195182130] [2024-11-14 04:05:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:31,410 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-14 04:05:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:05:31,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:05:31,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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)] Waiting until timeout for monitored process [2024-11-14 04:05:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:31,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:05:31,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2024-11-14 04:05:32,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:05:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-14 04:05:33,636 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:05:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195182130] [2024-11-14 04:05:33,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195182130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:05:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [500047151] [2024-11-14 04:05:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:33,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:05:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:05:33,638 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:05:33,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-14 04:05:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:35,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:05:35,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2024-11-14 04:05:35,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:05:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-14 04:05:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [500047151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:05:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41756876] [2024-11-14 04:05:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:36,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:05:36,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:05:36,529 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:05:36,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 04:05:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:36,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:05:36,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2024-11-14 04:05:37,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:05:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-14 04:05:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41756876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:05:38,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:05:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 8 [2024-11-14 04:05:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601148220] [2024-11-14 04:05:38,269 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:05:38,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:05:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:05:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:05:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:05:38,271 INFO L87 Difference]: Start difference. First operand 661 states and 978 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-14 04:05:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:05:40,876 INFO L93 Difference]: Finished difference Result 1715 states and 2470 transitions. [2024-11-14 04:05:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 04:05:40,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 179 [2024-11-14 04:05:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:05:40,885 INFO L225 Difference]: With dead ends: 1715 [2024-11-14 04:05:40,885 INFO L226 Difference]: Without dead ends: 1057 [2024-11-14 04:05:40,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 1060 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-14 04:05:40,888 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 124 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:05:40,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 308 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-14 04:05:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-14 04:05:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 964. [2024-11-14 04:05:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 585 states have (on average 1.218803418803419) internal successors, (713), 588 states have internal predecessors, (713), 327 states have call successors, (327), 51 states have call predecessors, (327), 51 states have return successors, (327), 324 states have call predecessors, (327), 327 states have call successors, (327) [2024-11-14 04:05:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1367 transitions. [2024-11-14 04:05:41,079 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1367 transitions. Word has length 179 [2024-11-14 04:05:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:05:41,082 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1367 transitions. [2024-11-14 04:05:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-14 04:05:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1367 transitions. [2024-11-14 04:05:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-14 04:05:41,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:05:41,084 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:05:41,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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)] Ended with exit code 0 [2024-11-14 04:05:41,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 04:05:41,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-14 04:05:41,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:05:41,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:05:41,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:05:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1570204145, now seen corresponding path program 1 times [2024-11-14 04:05:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:05:41,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303444370] [2024-11-14 04:05:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:41,687 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-14 04:05:41,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:05:41,688 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:05:41,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 (14)] Waiting until timeout for monitored process [2024-11-14 04:05:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:42,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:05:42,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 258 proven. 144 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-11-14 04:05:43,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:05:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-14 04:05:44,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:05:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303444370] [2024-11-14 04:05:44,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303444370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:05:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1857841885] [2024-11-14 04:05:44,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:44,547 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:05:44,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:05:44,548 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:05:44,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-14 04:05:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:45,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:05:45,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-14 04:05:45,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:05:45,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1857841885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:05:45,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:05:45,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 6] total 12 [2024-11-14 04:05:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171897016] [2024-11-14 04:05:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:05:45,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:05:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:05:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:05:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:05:45,127 INFO L87 Difference]: Start difference. First operand 964 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-14 04:05:46,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:48,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:50,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:05:51,166 INFO L93 Difference]: Finished difference Result 2250 states and 3174 transitions. [2024-11-14 04:05:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:05:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-11-14 04:05:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:05:51,176 INFO L225 Difference]: With dead ends: 2250 [2024-11-14 04:05:51,176 INFO L226 Difference]: Without dead ends: 1289 [2024-11-14 04:05:51,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 522 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-14 04:05:51,180 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 194 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:05:51,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 571 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-14 04:05:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-14 04:05:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1127. [2024-11-14 04:05:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 748 states have (on average 1.2633689839572193) internal successors, (945), 751 states have internal predecessors, (945), 327 states have call successors, (327), 51 states have call predecessors, (327), 51 states have return successors, (327), 324 states have call predecessors, (327), 327 states have call successors, (327) [2024-11-14 04:05:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1599 transitions. [2024-11-14 04:05:51,346 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1599 transitions. Word has length 179 [2024-11-14 04:05:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:05:51,347 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1599 transitions. [2024-11-14 04:05:51,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-14 04:05:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1599 transitions. [2024-11-14 04:05:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-14 04:05:51,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:05:51,350 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:05:51,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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 (14)] Ended with exit code 0 [2024-11-14 04:05:51,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-14 04:05:51,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:05:51,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:05:51,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:05:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1915416525, now seen corresponding path program 1 times [2024-11-14 04:05:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:05:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949877387] [2024-11-14 04:05:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:51,752 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-14 04:05:51,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:05:51,754 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:05:51,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f3b8bbb-e38f-4797-bfef-a9868087f9bb/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-14 04:05:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:52,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:05:52,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:06:41,164 WARN L286 SmtUtils]: Spent 9.75s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:08:16,654 WARN L286 SmtUtils]: Spent 36.58s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:10:22,271 WARN L286 SmtUtils]: Spent 45.72s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:12:51,614 WARN L286 SmtUtils]: Spent 57.55s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)