./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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 ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:27:04,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:27:04,220 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:27:04,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:27:04,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:27:04,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:27:04,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:27:04,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:27:04,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:27:04,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:27:04,253 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:27:04,253 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:27:04,253 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:27:04,254 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:27:04,254 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:27:04,254 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:27:04,254 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:27:04,254 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:27:04,254 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:27:04,254 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:27:04,254 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:27:04,254 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:27:04,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:27:04,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:27:04,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:27:04,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:27:04,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:27:04,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:27:04,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:27:04,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:27:04,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:27:04,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:27:04,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:27:04,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:27:04,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:27:04,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:27:04,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:27:04,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:27:04,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:27:04,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:27:04,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:27:04,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:27:04,260 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:27:04,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:27:04,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:27:04,260 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:27:04,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:27:04,260 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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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 -> ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 [2024-11-13 23:27:04,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:27:04,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:27:04,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:27:04,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:27:04,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:27:04,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i Unable to find full path for "g++" [2024-11-13 23:27:06,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:27:06,739 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:27:06,743 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-11-13 23:27:06,757 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/data/93a80c90c/54e71ff3188f49109a4e13b1d6841e21/FLAGa66c362d6 [2024-11-13 23:27:06,772 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/data/93a80c90c/54e71ff3188f49109a4e13b1d6841e21 [2024-11-13 23:27:06,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:27:06,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:27:06,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:27:06,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:27:06,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:27:06,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:27:06" (1/1) ... [2024-11-13 23:27:06,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e969b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:06, skipping insertion in model container [2024-11-13 23:27:06,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:27:06" (1/1) ... [2024-11-13 23:27:06,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:27:06,980 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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-13 23:27:07,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:27:07,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:27:07,116 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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-13 23:27:07,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:27:07,196 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:27:07,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07 WrapperNode [2024-11-13 23:27:07,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:27:07,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:27:07,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:27:07,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:27:07,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,289 INFO L138 Inliner]: procedures = 30, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2024-11-13 23:27:07,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:27:07,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:27:07,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:27:07,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:27:07,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:27:07,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:27:07,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:27:07,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:27:07,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (1/1) ... [2024-11-13 23:27:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:27:07,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:27:07,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:27:07,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:27:07,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:27:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-13 23:27:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-13 23:27:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:27:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 23:27:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 23:27:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 23:27:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:27:07,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:27:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:27:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:27:07,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:27:07,573 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:27:07,575 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:27:08,484 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-13 23:27:08,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:27:09,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:27:09,417 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:27:09,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:27:09 BoogieIcfgContainer [2024-11-13 23:27:09,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:27:09,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:27:09,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:27:09,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:27:09,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:27:06" (1/3) ... [2024-11-13 23:27:09,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c8d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:27:09, skipping insertion in model container [2024-11-13 23:27:09,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:07" (2/3) ... [2024-11-13 23:27:09,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c8d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:27:09, skipping insertion in model container [2024-11-13 23:27:09,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:27:09" (3/3) ... [2024-11-13 23:27:09,431 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i [2024-11-13 23:27:09,449 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:27:09,452 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-11.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:27:09,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:27:09,536 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;@bde3df8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:27:09,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:27:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 23:27:09,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:09,555 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:09,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:09,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash 905874068, now seen corresponding path program 1 times [2024-11-13 23:27:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:27:09,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647987347] [2024-11-13 23:27:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:27:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:27:12,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:27:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:27:13,105 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:27:13,107 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:27:13,109 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 23:27:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:27:13,116 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 23:27:13,187 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:27:13,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:27:13 BoogieIcfgContainer [2024-11-13 23:27:13,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:27:13,193 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:27:13,193 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:27:13,194 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:27:13,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:27:09" (3/4) ... [2024-11-13 23:27:13,235 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:27:13,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:27:13,239 INFO L158 Benchmark]: Toolchain (without parser) took 6462.35ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 119.0MB in the beginning and 386.7MB in the end (delta: -267.6MB). Peak memory consumption was 253.8MB. Max. memory is 16.1GB. [2024-11-13 23:27:13,239 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:27:13,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.51ms. Allocated memory is still 142.6MB. Free memory was 119.0MB in the beginning and 101.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:27:13,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.11ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 97.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:27:13,240 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:27:13,240 INFO L158 Benchmark]: RCFGBuilder took 2077.29ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 73.8MB in the end (delta: 20.5MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-11-13 23:27:13,244 INFO L158 Benchmark]: TraceAbstraction took 3770.96ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 73.8MB in the beginning and 152.8MB in the end (delta: -79.0MB). Peak memory consumption was 210.2MB. Max. memory is 16.1GB. [2024-11-13 23:27:13,244 INFO L158 Benchmark]: Witness Printer took 42.95ms. Allocated memory is still 427.8MB. Free memory was 152.8MB in the beginning and 386.7MB in the end (delta: -233.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:27:13,247 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.51ms. Allocated memory is still 142.6MB. Free memory was 119.0MB in the beginning and 101.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.11ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 97.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2077.29ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 73.8MB in the end (delta: 20.5MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3770.96ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 73.8MB in the beginning and 152.8MB in the end (delta: -79.0MB). Peak memory consumption was 210.2MB. Max. memory is 16.1GB. * Witness Printer took 42.95ms. Allocated memory is still 427.8MB. Free memory was 152.8MB in the beginning and 386.7MB in the end (delta: -233.9MB). Peak memory consumption was 8.4MB. 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 62, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -16, 50.75, 7.675, 10, 32.5, 1000000.7, 2.4, 1, 1, 1, 5, 200, 10, 1 }; [L55] unsigned char last_1_WrapperStruct00_var_1_11 = 1; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_11 [L116] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L89] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L91] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_9 [L96] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L96] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) [L96] EXPR WrapperStruct00.var_1_9 [L96] EXPR WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F [L96] EXPR WrapperStruct00.var_1_9 [L96] EXPR WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F [L96] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_10 [L98] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_10 [L98] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L98] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L100] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L101] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L112] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L113] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L127] RET updateVariables() [L128] CALL step() [L59] EXPR WrapperStruct00.var_1_3 [L59] EXPR WrapperStruct00.var_1_2 [L59] COND TRUE WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2 [L60] COND TRUE \read(last_1_WrapperStruct00_var_1_11) [L61] COND FALSE !(! last_1_WrapperStruct00_var_1_11) [L64] EXPR WrapperStruct00.var_1_9 [L64] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_9 [L68] EXPR WrapperStruct00.var_1_8 [L68] EXPR WrapperStruct00.var_1_8 [L68] COND FALSE !(WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) [L71] EXPR WrapperStruct00.var_1_11 [L71] unsigned char stepLocal_0 = WrapperStruct00.var_1_11; [L72] EXPR WrapperStruct00.var_1_2 [L72] EXPR WrapperStruct00.var_1_8 [L72] EXPR WrapperStruct00.var_1_8 [L72] COND FALSE !((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) [L81] EXPR WrapperStruct00.var_1_11 [L81] COND FALSE !(! WrapperStruct00.var_1_11) [L84] EXPR WrapperStruct00.var_1_16 [L84] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_16 [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR ((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1 [L119] EXPR WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11 [L119] EXPR (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L119] EXPR (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1 [L119] EXPR ((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1 [L119] EXPR (((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1) [L119] EXPR ((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1) [L119] EXPR (((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_14 == ((unsigned char) ((((((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) < (WrapperStruct00.var_1_17)) ? (((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) : (WrapperStruct00.var_1_17))))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) [L119-L120] return (((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_14 == ((unsigned char) ((((((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) < (WrapperStruct00.var_1_17)) ? (((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) : (WrapperStruct00.var_1_17))))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 1, TraceHistogramMax: 16, 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=41occurred 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.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 23:27:13,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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 ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:27:15,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:27:15,998 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-13 23:27:16,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:27:16,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:27:16,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:27:16,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:27:16,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:27:16,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:27:16,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:27:16,030 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:27:16,030 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:27:16,030 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:27:16,030 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:27:16,030 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:27:16,030 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:27:16,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:27:16,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:27:16,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:27:16,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:27:16,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:27:16,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:27:16,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:27:16,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:27:16,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:27:16,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:27:16,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:27:16,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:27:16,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:27:16,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:27:16,033 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:27:16,033 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:27:16,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:27:16,033 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:27:16,033 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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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 -> ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 [2024-11-13 23:27:16,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:27:16,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:27:16,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:27:16,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:27:16,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:27:16,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i Unable to find full path for "g++" [2024-11-13 23:27:18,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:27:18,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:27:18,614 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-11-13 23:27:18,623 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/data/f4db89a62/cc9ded7ce92b4d70bf4c4d724b2aacc8/FLAG28f310fd2 [2024-11-13 23:27:18,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/data/f4db89a62/cc9ded7ce92b4d70bf4c4d724b2aacc8 [2024-11-13 23:27:18,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:27:18,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:27:18,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:27:18,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:27:18,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:27:18,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:27:18" (1/1) ... [2024-11-13 23:27:18,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4171a694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:18, skipping insertion in model container [2024-11-13 23:27:18,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:27:18" (1/1) ... [2024-11-13 23:27:18,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:27:18,884 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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-13 23:27:18,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:27:18,999 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:27:19,014 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_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-13 23:27:19,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:27:19,135 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:27:19,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19 WrapperNode [2024-11-13 23:27:19,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:27:19,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:27:19,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:27:19,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:27:19,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,239 INFO L138 Inliner]: procedures = 34, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2024-11-13 23:27:19,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:27:19,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:27:19,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:27:19,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:27:19,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:27:19,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:27:19,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:27:19,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:27:19,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (1/1) ... [2024-11-13 23:27:19,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:27:19,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:27:19,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:27:19,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:27:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:27:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-13 23:27:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2024-11-13 23:27:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-13 23:27:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-13 23:27:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:27:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-13 23:27:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-13 23:27:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2024-11-13 23:27:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:27:19,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:27:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2024-11-13 23:27:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:27:19,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:27:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-13 23:27:19,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:27:19,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:27:31,060 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2024-11-13 23:27:31,061 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:27:31,077 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:27:31,077 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:27:31,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:27:31 BoogieIcfgContainer [2024-11-13 23:27:31,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:27:31,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:27:31,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:27:31,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:27:31,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:27:18" (1/3) ... [2024-11-13 23:27:31,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f28a2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:27:31, skipping insertion in model container [2024-11-13 23:27:31,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:27:19" (2/3) ... [2024-11-13 23:27:31,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f28a2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:27:31, skipping insertion in model container [2024-11-13 23:27:31,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:27:31" (3/3) ... [2024-11-13 23:27:31,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i [2024-11-13 23:27:31,112 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:27:31,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-11.i that has 2 procedures, 139 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:27:31,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:27:31,246 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;@6bad13c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:27:31,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:27:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 23:27:31,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:31,268 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:31,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1123503858, now seen corresponding path program 1 times [2024-11-13 23:27:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:31,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103799134] [2024-11-13 23:27:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:31,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:31,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 23:27:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:32,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 23:27:32,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-13 23:27:32,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:32,827 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:32,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103799134] [2024-11-13 23:27:32,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103799134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:32,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:27:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398348222] [2024-11-13 23:27:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:32,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 23:27:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:32,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 23:27:32,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:27:32,864 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 23:27:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:32,920 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-11-13 23:27:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 23:27:32,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-13 23:27:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:32,936 INFO L225 Difference]: With dead ends: 271 [2024-11-13 23:27:32,936 INFO L226 Difference]: Without dead ends: 135 [2024-11-13 23:27:32,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:27:32,945 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:32,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:27:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-13 23:27:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-13 23:27:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-13 23:27:33,004 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-11-13 23:27:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:33,004 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-13 23:27:33,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 23:27:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-13 23:27:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 23:27:33,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:33,009 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:33,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:27:33,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:33,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:33,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 328080218, now seen corresponding path program 1 times [2024-11-13 23:27:33,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172525588] [2024-11-13 23:27:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:33,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:33,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:33,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 23:27:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:34,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:27:34,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 23:27:34,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:34,538 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:34,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172525588] [2024-11-13 23:27:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172525588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:34,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:34,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:27:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947277717] [2024-11-13 23:27:34,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:34,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:27:34,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:34,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:27:34,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:27:34,542 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 23:27:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:34,740 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-11-13 23:27:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:27:34,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-13 23:27:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:34,743 INFO L225 Difference]: With dead ends: 269 [2024-11-13 23:27:34,743 INFO L226 Difference]: Without dead ends: 137 [2024-11-13 23:27:34,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:27:34,745 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:34,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:27:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-13 23:27:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-13 23:27:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-13 23:27:34,759 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-11-13 23:27:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:34,760 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-13 23:27:34,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 23:27:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-13 23:27:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 23:27:34,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:34,763 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:34,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:27:34,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:34,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:34,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1610252504, now seen corresponding path program 1 times [2024-11-13 23:27:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:34,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074448272] [2024-11-13 23:27:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:34,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:34,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:34,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:34,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 23:27:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:36,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:27:36,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 23:27:36,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:36,266 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074448272] [2024-11-13 23:27:36,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074448272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:36,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:36,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:27:36,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139070142] [2024-11-13 23:27:36,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:36,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:27:36,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:27:36,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:27:36,273 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 23:27:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:36,436 INFO L93 Difference]: Finished difference Result 273 states and 406 transitions. [2024-11-13 23:27:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:27:36,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-13 23:27:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:36,439 INFO L225 Difference]: With dead ends: 273 [2024-11-13 23:27:36,439 INFO L226 Difference]: Without dead ends: 139 [2024-11-13 23:27:36,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:27:36,441 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:36,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:27:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-13 23:27:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-13 23:27:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 121 states have internal predecessors, (173), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2024-11-13 23:27:36,454 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 133 [2024-11-13 23:27:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:36,454 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2024-11-13 23:27:36,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 23:27:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2024-11-13 23:27:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 23:27:36,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:36,457 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:36,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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-13 23:27:36,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:36,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:36,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:36,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1913981226, now seen corresponding path program 1 times [2024-11-13 23:27:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559337863] [2024-11-13 23:27:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:36,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:36,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:36,662 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:36,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 23:27:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:37,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:27:37,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:27:38,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:38,019 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:38,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559337863] [2024-11-13 23:27:38,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559337863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:38,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:38,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:27:38,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722858942] [2024-11-13 23:27:38,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:38,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:27:38,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:38,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:27:38,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:27:38,021 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:38,154 INFO L93 Difference]: Finished difference Result 277 states and 410 transitions. [2024-11-13 23:27:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:27:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-13 23:27:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:38,157 INFO L225 Difference]: With dead ends: 277 [2024-11-13 23:27:38,157 INFO L226 Difference]: Without dead ends: 141 [2024-11-13 23:27:38,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:27:38,159 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:38,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:27:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-13 23:27:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-13 23:27:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-11-13 23:27:38,172 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 133 [2024-11-13 23:27:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:38,173 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-11-13 23:27:38,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-11-13 23:27:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 23:27:38,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:38,176 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:38,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-13 23:27:38,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:38,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:38,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1212803046, now seen corresponding path program 1 times [2024-11-13 23:27:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:38,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033576791] [2024-11-13 23:27:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:38,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:38,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:38,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:38,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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-13 23:27:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:39,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:27:39,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:27:39,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:39,761 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:39,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033576791] [2024-11-13 23:27:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033576791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:39,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:27:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331419113] [2024-11-13 23:27:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:39,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:27:39,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:39,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:27:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:27:39,764 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:39,987 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2024-11-13 23:27:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:27:39,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-13 23:27:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:39,990 INFO L225 Difference]: With dead ends: 282 [2024-11-13 23:27:39,990 INFO L226 Difference]: Without dead ends: 144 [2024-11-13 23:27:39,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:27:39,992 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:39,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:27:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-13 23:27:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-13 23:27:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-13 23:27:40,015 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 135 [2024-11-13 23:27:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:40,016 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-13 23:27:40,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-13 23:27:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 23:27:40,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:40,018 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:40,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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)] Ended with exit code 0 [2024-11-13 23:27:40,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:40,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:40,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1932998259, now seen corresponding path program 1 times [2024-11-13 23:27:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:40,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27859161] [2024-11-13 23:27:40,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:40,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:40,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:40,228 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:40,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 23:27:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:41,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:27:41,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:27:41,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:41,533 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27859161] [2024-11-13 23:27:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27859161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:27:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123364537] [2024-11-13 23:27:41,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:41,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:27:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:41,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:27:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:27:41,536 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:45,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:27:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:45,815 INFO L93 Difference]: Finished difference Result 286 states and 419 transitions. [2024-11-13 23:27:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:27:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-13 23:27:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:45,818 INFO L225 Difference]: With dead ends: 286 [2024-11-13 23:27:45,818 INFO L226 Difference]: Without dead ends: 145 [2024-11-13 23:27:45,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:27:45,820 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:45,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 499 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-13 23:27:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-13 23:27:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-13 23:27:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 127 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-11-13 23:27:45,830 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 136 [2024-11-13 23:27:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:45,831 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-11-13 23:27:45,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-11-13 23:27:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 23:27:45,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:45,835 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:45,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:27:46,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:46,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:46,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1775163023, now seen corresponding path program 1 times [2024-11-13 23:27:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775994600] [2024-11-13 23:27:46,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:46,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:46,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:46,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 23:27:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:47,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:27:47,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:27:47,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:47,302 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775994600] [2024-11-13 23:27:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775994600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:27:47,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687482206] [2024-11-13 23:27:47,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:27:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:47,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:27:47,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:27:47,304 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:47,679 INFO L93 Difference]: Finished difference Result 290 states and 423 transitions. [2024-11-13 23:27:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:27:47,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-13 23:27:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:47,683 INFO L225 Difference]: With dead ends: 290 [2024-11-13 23:27:47,683 INFO L226 Difference]: Without dead ends: 148 [2024-11-13 23:27:47,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:27:47,684 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:47,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:27:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-13 23:27:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-13 23:27:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.40625) internal successors, (180), 128 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-13 23:27:47,696 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 136 [2024-11-13 23:27:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:47,697 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-13 23:27:47,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-13 23:27:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 23:27:47,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:47,700 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:47,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-13 23:27:47,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:47,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:47,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash -148505425, now seen corresponding path program 1 times [2024-11-13 23:27:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:47,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156187874] [2024-11-13 23:27:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:47,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:47,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:47,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:47,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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-13 23:27:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:49,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:27:49,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:27:49,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:49,478 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156187874] [2024-11-13 23:27:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156187874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:27:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244265996] [2024-11-13 23:27:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:27:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:27:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:27:49,484 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:49,866 INFO L93 Difference]: Finished difference Result 293 states and 426 transitions. [2024-11-13 23:27:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:27:49,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-13 23:27:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:49,870 INFO L225 Difference]: With dead ends: 293 [2024-11-13 23:27:49,870 INFO L226 Difference]: Without dead ends: 150 [2024-11-13 23:27:49,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:27:49,872 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:49,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:27:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-13 23:27:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-11-13 23:27:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 129 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2024-11-13 23:27:49,895 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 137 [2024-11-13 23:27:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:49,898 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2024-11-13 23:27:49,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2024-11-13 23:27:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 23:27:49,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:49,901 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:49,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:27:50,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:50,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2113419956, now seen corresponding path program 1 times [2024-11-13 23:27:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888631764] [2024-11-13 23:27:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:50,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:50,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:50,105 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:50,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-13 23:27:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:51,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:27:51,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:27:51,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:51,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:51,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888631764] [2024-11-13 23:27:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888631764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:51,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:51,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:27:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351204988] [2024-11-13 23:27:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:27:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:27:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:27:51,464 INFO L87 Difference]: Start difference. First operand 147 states and 213 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:27:51,700 INFO L93 Difference]: Finished difference Result 294 states and 427 transitions. [2024-11-13 23:27:51,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:27:51,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-13 23:27:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:27:51,703 INFO L225 Difference]: With dead ends: 294 [2024-11-13 23:27:51,703 INFO L226 Difference]: Without dead ends: 150 [2024-11-13 23:27:51,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:27:51,704 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:27:51,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:27:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-13 23:27:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-13 23:27:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:27:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 216 transitions. [2024-11-13 23:27:51,714 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 216 transitions. Word has length 137 [2024-11-13 23:27:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:27:51,715 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 216 transitions. [2024-11-13 23:27:51,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 216 transitions. [2024-11-13 23:27:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 23:27:51,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:27:51,717 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:27:51,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-13 23:27:51,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:51,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:27:51,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:27:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash 452254388, now seen corresponding path program 1 times [2024-11-13 23:27:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:27:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62107585] [2024-11-13 23:27:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:27:51,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:27:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:27:51,921 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:27:51,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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-13 23:27:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:53,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 23:27:53,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:53,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:27:53,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-13 23:27:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:27:53,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:27:53,559 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:27:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62107585] [2024-11-13 23:27:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62107585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:27:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:27:53,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:27:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844076968] [2024-11-13 23:27:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:27:53,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:27:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:27:53,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:27:53,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:27:53,560 INFO L87 Difference]: Start difference. First operand 150 states and 216 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:27:57,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:27:59,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:01,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:03,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:05,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:07,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:09,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:11,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:14,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:16,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:18,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:20,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:22,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:24,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:26,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:28,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:28:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:29,153 INFO L93 Difference]: Finished difference Result 298 states and 430 transitions. [2024-11-13 23:28:29,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:28:29,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-13 23:28:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:29,155 INFO L225 Difference]: With dead ends: 298 [2024-11-13 23:28:29,156 INFO L226 Difference]: Without dead ends: 151 [2024-11-13 23:28:29,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:28:29,157 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:29,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 594 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 16 Unknown, 0 Unchecked, 35.4s Time] [2024-11-13 23:28:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-13 23:28:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-13 23:28:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 23:28:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 215 transitions. [2024-11-13 23:28:29,167 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 215 transitions. Word has length 138 [2024-11-13 23:28:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:29,167 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 215 transitions. [2024-11-13 23:28:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:28:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 215 transitions. [2024-11-13 23:28:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 23:28:29,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:29,170 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:29,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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-13 23:28:29,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:28:29,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:28:29,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1097564902, now seen corresponding path program 1 times [2024-11-13 23:28:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:28:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594602326] [2024-11-13 23:28:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:29,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:28:29,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:28:29,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:28:29,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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 (12)] Waiting until timeout for monitored process [2024-11-13 23:28:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:30,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 23:28:30,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:30,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:30,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:30,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:31,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 51 [2024-11-13 23:28:31,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:31,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 98 [2024-11-13 23:28:35,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:35,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 112 treesize of output 121 [2024-11-13 23:28:41,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:41,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-13 23:28:43,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:43,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-13 23:28:44,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:44,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-13 23:28:45,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:45,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 118 [2024-11-13 23:28:51,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:51,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 105 [2024-11-13 23:28:57,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:57,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 102 [2024-11-13 23:29:02,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:02,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 111 [2024-11-13 23:29:04,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:04,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 115 [2024-11-13 23:29:06,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:06,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 156 treesize of output 60 [2024-11-13 23:29:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 384 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 23:29:06,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:29:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:29:07,900 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:29:07,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594602326] [2024-11-13 23:29:07,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594602326] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 23:29:07,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:29:07,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2024-11-13 23:29:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693250621] [2024-11-13 23:29:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:29:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:29:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:29:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=104, Unknown=9, NotChecked=0, Total=156 [2024-11-13 23:29:07,903 INFO L87 Difference]: Start difference. First operand 150 states and 215 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:29:11,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:29:13,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:29:16,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:29:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:18,271 INFO L93 Difference]: Finished difference Result 444 states and 639 transitions. [2024-11-13 23:29:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:29:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-13 23:29:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:18,280 INFO L225 Difference]: With dead ends: 444 [2024-11-13 23:29:18,280 INFO L226 Difference]: Without dead ends: 297 [2024-11-13 23:29:18,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=47, Invalid=126, Unknown=9, NotChecked=0, Total=182 [2024-11-13 23:29:18,282 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 139 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:18,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 337 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 259 Invalid, 3 Unknown, 0 Unchecked, 10.2s Time] [2024-11-13 23:29:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-13 23:29:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2024-11-13 23:29:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 257 states have (on average 1.3852140077821011) internal successors, (356), 257 states have internal predecessors, (356), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 23:29:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2024-11-13 23:29:18,311 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 140 [2024-11-13 23:29:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:18,312 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2024-11-13 23:29:18,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:29:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2024-11-13 23:29:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 23:29:18,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:18,317 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:18,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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 (12)] Ended with exit code 0 [2024-11-13 23:29:18,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:29:18,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:29:18,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1883318015, now seen corresponding path program 1 times [2024-11-13 23:29:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:29:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336996823] [2024-11-13 23:29:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:18,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:29:18,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:29:18,523 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:29:18,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-13 23:29:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:20,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 23:29:20,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:29:20,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:29:20,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:29:20,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:29:21,339 INFO L224 Elim1Store]: Index analysis took 799 ms [2024-11-13 23:29:21,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 58 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 21 [2024-11-13 23:29:22,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 49 [2024-11-13 23:29:25,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:25,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 182 treesize of output 125 [2024-11-13 23:29:29,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:29,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 196 treesize of output 132 [2024-11-13 23:29:33,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:33,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 201 treesize of output 131 [2024-11-13 23:29:35,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:35,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 201 treesize of output 131 [2024-11-13 23:29:36,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:36,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 201 treesize of output 122 [2024-11-13 23:29:40,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:40,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 118 [2024-11-13 23:29:41,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:41,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 118 [2024-11-13 23:29:43,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:43,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 186 treesize of output 128 [2024-11-13 23:29:45,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:45,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 196 treesize of output 141 [2024-11-13 23:29:49,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 180 [2024-11-13 23:29:49,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:29:49,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:29:49,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 180 treesize of output 228 [2024-11-13 23:29:50,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 79 [2024-11-13 23:30:17,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse12 (concat (select .cse10 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse10 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) (.cse2 (let ((.cse11 (select .cse10 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (and (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_21| (_ BitVec 8))) (= (select .cse10 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_21|)))) (.cse4 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2)) (.cse5 (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (and (= (select .cse10 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)) (= (select .cse10 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|))))) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) (select .cse10 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (select .cse10 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_22|) (select .cse10 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|)))))) (or (and .cse3 .cse4 .cse5 (= .cse6 ((_ sign_extend 24) (_ bv1 8))) .cse7 .cse8 .cse9) (and .cse3 .cse4 .cse5 .cse7 (= .cse6 ((_ sign_extend 24) (_ bv0 8))) .cse8 .cse9))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 23:30:19,502 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse12 (concat (select .cse10 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse10 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) (.cse2 (let ((.cse11 (select .cse10 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (and (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_21| (_ BitVec 8))) (= (select .cse10 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_21|)))) (.cse4 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2)) (.cse5 (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (and (= (select .cse10 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)) (= (select .cse10 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|))))) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) (select .cse10 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (select .cse10 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_22|) (select .cse10 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|)))))) (or (and .cse3 .cse4 .cse5 (= .cse6 ((_ sign_extend 24) (_ bv1 8))) .cse7 .cse8 .cse9) (and .cse3 .cse4 .cse5 .cse7 (= .cse6 ((_ sign_extend 24) (_ bv0 8))) .cse8 .cse9))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 23:30:40,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:30:40,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 432 treesize of output 242 [2024-11-13 23:31:02,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse13 (concat (select .cse11 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse11 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) (.cse2 (let ((.cse12 (select .cse11 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (and (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse3 (select .cse11 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2)) (.cse10 (select .cse11 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (select .cse11 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))) (.cse7 (select .cse11 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse9 (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))) (.cse6 (select .cse11 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse5 (select .cse11 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)))) (or (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_21| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_21|))) .cse4 (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (and (= .cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)) (= .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|)))) (= .cse7 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) .cse8)) .cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_22|) .cse10))) (and (exists ((v_prenex_7 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_7) .cse3)) .cse4 (exists ((v_prenex_6 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_6) .cse10)) (exists ((v_prenex_8 (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) v_prenex_8))) (= .cse7 ((_ sign_extend 24) (_ bv0 8))) .cse9 (exists ((v_prenex_9 (_ BitVec 64))) (and (= .cse6 ((_ extract 63 32) v_prenex_9)) (= ((_ extract 31 0) v_prenex_9) .cse5)))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 23:31:05,039 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse13 (concat (select .cse11 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse11 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) (.cse2 (let ((.cse12 (select .cse11 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (and (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse3 (select .cse11 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2)) (.cse10 (select .cse11 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (select .cse11 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))) (.cse7 (select .cse11 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse9 (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))) (.cse6 (select .cse11 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse5 (select .cse11 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)))) (or (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_21| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_21|))) .cse4 (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (and (= .cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)) (= .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|)))) (= .cse7 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) .cse8)) .cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_22|) .cse10))) (and (exists ((v_prenex_7 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_7) .cse3)) .cse4 (exists ((v_prenex_6 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_6) .cse10)) (exists ((v_prenex_8 (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) v_prenex_8))) (= .cse7 ((_ sign_extend 24) (_ bv0 8))) .cse9 (exists ((v_prenex_9 (_ BitVec 64))) (and (= .cse6 ((_ extract 63 32) v_prenex_9)) (= ((_ extract 31 0) v_prenex_9) .cse5)))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 23:31:05,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:31:05,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 518 treesize of output 194 [2024-11-13 23:31:21,467 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_183 (_ BitVec 32)) (v_arrayElimCell_177 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_183) ((_ extract 30 23) v_arrayElimCell_183) ((_ extract 22 0) v_arrayElimCell_183))) (.cse1 (let ((.cse3 (concat v_arrayElimCell_182 v_arrayElimCell_177))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (and (= |c_ULTIMATE.start_property_#t~mem103#1| .cse0) (not (fp.lt (fp.sub c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse0) (= |c_ULTIMATE.start_property_#t~mem102#1| .cse0) (= |c_ULTIMATE.start_property_#t~mem101#1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 23:31:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 113 proven. 275 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-13 23:31:21,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:31:27,653 WARN L851 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from false [2024-11-13 23:31:29,735 WARN L873 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from true [2024-11-13 23:31:35,896 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select .cse1 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from false [2024-11-13 23:31:37,949 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select .cse1 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from true [2024-11-13 23:31:56,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (not (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse1)))))))) is different from false [2024-11-13 23:31:58,976 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (not (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse1)))))))) is different from true [2024-11-13 23:31:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:31:59,741 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:31:59,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336996823] [2024-11-13 23:31:59,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336996823] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 23:31:59,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:31:59,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2024-11-13 23:31:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381929240] [2024-11-13 23:31:59,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:59,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:31:59,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:31:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:31:59,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=267, Unknown=14, NotChecked=234, Total=600 [2024-11-13 23:31:59,743 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:31:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:59,759 INFO L93 Difference]: Finished difference Result 589 states and 849 transitions. [2024-11-13 23:31:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:31:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2024-11-13 23:31:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:59,762 INFO L225 Difference]: With dead ends: 589 [2024-11-13 23:31:59,762 INFO L226 Difference]: Without dead ends: 300 [2024-11-13 23:31:59,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=85, Invalid=267, Unknown=14, NotChecked=234, Total=600 [2024-11-13 23:31:59,764 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:59,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 617 Unchecked, 0.0s Time] [2024-11-13 23:31:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-13 23:31:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-13 23:31:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 265 states have (on average 1.381132075471698) internal successors, (366), 265 states have internal predecessors, (366), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 23:31:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 430 transitions. [2024-11-13 23:31:59,788 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 430 transitions. Word has length 142 [2024-11-13 23:31:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:59,788 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 430 transitions. [2024-11-13 23:31:59,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:31:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 430 transitions. [2024-11-13 23:31:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 23:31:59,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:59,791 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:59,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-13 23:31:59,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:31:59,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:31:59,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash -549553450, now seen corresponding path program 1 times [2024-11-13 23:31:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:31:59,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687345672] [2024-11-13 23:31:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:59,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:31:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:31:59,994 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:31:59,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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-13 23:32:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:01,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 23:32:01,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:32:01,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:32:02,554 INFO L224 Elim1Store]: Index analysis took 1115 ms [2024-11-13 23:32:02,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 10 [2024-11-13 23:32:03,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 46 [2024-11-13 23:32:08,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:08,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 96 [2024-11-13 23:32:12,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:12,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 232 treesize of output 144 [2024-11-13 23:32:15,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:15,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 153 [2024-11-13 23:32:17,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:17,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 153 [2024-11-13 23:32:19,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:19,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 153 [2024-11-13 23:32:21,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:21,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 144 [2024-11-13 23:32:24,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:24,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 140 [2024-11-13 23:32:26,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:26,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 140 [2024-11-13 23:32:28,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:28,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 140 [2024-11-13 23:32:32,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 182 [2024-11-13 23:32:32,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:32:32,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:33,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 182 treesize of output 214 [2024-11-13 23:32:33,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:32:33,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 112 [2024-11-13 23:32:35,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:35,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 417 treesize of output 245 [2024-11-13 23:32:55,614 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse1 (select .cse13 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse2 (select .cse13 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (let ((.cse14 (select .cse13 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse0 (concat .cse1 .cse2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse4))) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0))))))) (let ((.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_23| (_ BitVec 8))) (= (select .cse13 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_23|)))) (.cse6 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse4)) (.cse7 (select .cse13 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (fp.leq (let ((.cse12 (concat (select .cse13 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse13 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))))) (.cse9 (exists ((|v_skolemized_q#valueAsBitvector_91| (_ BitVec 64))) (let ((.cse11 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_91|))) (and (fp.leq (let ((.cse10 (concat .cse1 .cse11))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (= .cse11 .cse2)))))) (or (and .cse5 .cse6 (= .cse7 ((_ sign_extend 24) (_ bv1 8))) .cse8 .cse9) (and .cse5 .cse6 (= .cse7 ((_ sign_extend 24) (_ bv0 8))) .cse8 .cse9)))))) is different from false [2024-11-13 23:32:57,657 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse1 (select .cse13 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse2 (select .cse13 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (let ((.cse14 (select .cse13 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse0 (concat .cse1 .cse2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse4))) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0))))))) (let ((.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_23| (_ BitVec 8))) (= (select .cse13 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_23|)))) (.cse6 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse4)) (.cse7 (select .cse13 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (fp.leq (let ((.cse12 (concat (select .cse13 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse13 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))))) (.cse9 (exists ((|v_skolemized_q#valueAsBitvector_91| (_ BitVec 64))) (let ((.cse11 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_91|))) (and (fp.leq (let ((.cse10 (concat .cse1 .cse11))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (= .cse11 .cse2)))))) (or (and .cse5 .cse6 (= .cse7 ((_ sign_extend 24) (_ bv1 8))) .cse8 .cse9) (and .cse5 .cse6 (= .cse7 ((_ sign_extend 24) (_ bv0 8))) .cse8 .cse9)))))) is different from true [2024-11-13 23:33:12,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:33:12,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 537 treesize of output 213 [2024-11-13 23:33:54,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_263 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (concat v_arrayElimCell_263 v_arrayElimCell_267))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (and (fp.leq .cse13 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (= .cse13 |c_ULTIMATE.start_property_#t~mem116#1|))))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))) (or (and .cse0 (exists ((v_arrayElimCell_269 (_ BitVec 32)) (v_arrayElimCell_268 (_ BitVec 32)) (v_prenex_13 (_ BitVec 64))) (let ((.cse3 (let ((.cse8 (concat v_arrayElimCell_268 ((_ extract 31 0) v_prenex_13)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_269) ((_ extract 30 23) v_arrayElimCell_269) ((_ extract 22 0) v_arrayElimCell_269)))) (and (= .cse1 .cse2) (= .cse3 |c_ULTIMATE.start_property_#t~mem117#1|) (fp.leq .cse3 .cse4) (not (fp.lt (fp.sub roundNearestTiesToEven .cse3 .cse5) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven .cse2))) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse6 .cse7))))))))) (and .cse0 (exists ((v_arrayElimCell_269 (_ BitVec 32)) (v_arrayElimCell_268 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_91| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_269) ((_ extract 30 23) v_arrayElimCell_269) ((_ extract 22 0) v_arrayElimCell_269))) (.cse9 (let ((.cse12 (concat v_arrayElimCell_268 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_91|)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (and (fp.leq .cse9 .cse4) (= .cse1 .cse10) (not (fp.lt (fp.sub roundNearestTiesToEven .cse9 .cse5) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven .cse10))) (fp.mul roundNearestTiesToEven .cse11 (fp.mul roundNearestTiesToEven .cse11 .cse7))))) (= |c_ULTIMATE.start_property_#t~mem117#1| .cse9))))))) is different from false [2024-11-13 23:33:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 31 proven. 277 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-13 23:33:56,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:34:08,148 WARN L851 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-13 23:34:10,207 WARN L873 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from true [2024-11-13 23:34:20,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from false [2024-11-13 23:34:22,628 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from true [2024-11-13 23:35:53,557 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (fp.geq |c_ULTIMATE.start_step_#t~mem4#1| |c_ULTIMATE.start_step_#t~mem5#1|) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from false [2024-11-13 23:35:55,616 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (fp.geq |c_ULTIMATE.start_step_#t~mem4#1| |c_ULTIMATE.start_step_#t~mem5#1|) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from true [2024-11-13 23:35:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:35:56,383 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:35:56,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687345672] [2024-11-13 23:35:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687345672] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 23:35:56,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:35:56,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2024-11-13 23:35:56,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397810088] [2024-11-13 23:35:56,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:35:56,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:35:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:35:56,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:35:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=373, Unknown=9, NotChecked=220, Total=702 [2024-11-13 23:35:56,385 INFO L87 Difference]: Start difference. First operand 300 states and 430 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:36:00,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:36:02,270 INFO L93 Difference]: Finished difference Result 689 states and 981 transitions. [2024-11-13 23:36:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:36:02,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-13 23:36:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:36:02,275 INFO L225 Difference]: With dead ends: 689 [2024-11-13 23:36:02,275 INFO L226 Difference]: Without dead ends: 392 [2024-11-13 23:36:02,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=104, Invalid=413, Unknown=9, NotChecked=230, Total=756 [2024-11-13 23:36:02,278 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 45 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 813 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:36:02,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 458 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 1 Unknown, 813 Unchecked, 5.7s Time] [2024-11-13 23:36:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-13 23:36:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 326. [2024-11-13 23:36:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 291 states have (on average 1.3711340206185567) internal successors, (399), 291 states have internal predecessors, (399), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 23:36:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 463 transitions. [2024-11-13 23:36:02,308 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 463 transitions. Word has length 143 [2024-11-13 23:36:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:36:02,309 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 463 transitions. [2024-11-13 23:36:02,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:36:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 463 transitions. [2024-11-13 23:36:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 23:36:02,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:36:02,313 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:36:02,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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-13 23:36:02,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:36:02,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:36:02,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:36:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1901310138, now seen corresponding path program 1 times [2024-11-13 23:36:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:36:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724468450] [2024-11-13 23:36:02,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:02,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:36:02,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:36:02,516 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:36:02,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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)] Waiting until timeout for monitored process [2024-11-13 23:36:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:04,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 23:36:04,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:04,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 23:36:04,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-13 23:36:04,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-13 23:36:05,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-13 23:36:06,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:06,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-11-13 23:36:08,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:08,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-13 23:36:08,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:08,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-11-13 23:36:10,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:10,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 27 [2024-11-13 23:36:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 333 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-13 23:36:11,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:36:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:36:15,332 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:36:15,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724468450] [2024-11-13 23:36:15,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724468450] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 23:36:15,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:36:15,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-13 23:36:15,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103602173] [2024-11-13 23:36:15,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:36:15,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 23:36:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:36:15,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 23:36:15,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 23:36:15,335 INFO L87 Difference]: Start difference. First operand 326 states and 463 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:36:22,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:24,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:26,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:28,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:30,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:32,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:34,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:37,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:39,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:41,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:36:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:36:48,187 INFO L93 Difference]: Finished difference Result 937 states and 1331 transitions. [2024-11-13 23:36:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:36:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-13 23:36:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:36:48,192 INFO L225 Difference]: With dead ends: 937 [2024-11-13 23:36:48,192 INFO L226 Difference]: Without dead ends: 614 [2024-11-13 23:36:48,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-11-13 23:36:48,194 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 210 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 35 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:36:48,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 890 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 647 Invalid, 10 Unknown, 0 Unchecked, 31.2s Time] [2024-11-13 23:36:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-13 23:36:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 566. [2024-11-13 23:36:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 517 states have (on average 1.3868471953578336) internal successors, (717), 519 states have internal predecessors, (717), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:36:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 805 transitions. [2024-11-13 23:36:48,234 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 805 transitions. Word has length 143 [2024-11-13 23:36:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:36:48,235 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 805 transitions. [2024-11-13 23:36:48,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:36:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 805 transitions. [2024-11-13 23:36:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 23:36:48,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:36:48,237 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:36:48,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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)] Ended with exit code 0 [2024-11-13 23:36:48,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:36:48,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:36:48,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:36:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1221251768, now seen corresponding path program 1 times [2024-11-13 23:36:48,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:36:48,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681664645] [2024-11-13 23:36:48,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:48,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:36:48,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:36:48,441 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:36:48,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-13 23:36:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:50,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 23:36:50,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:50,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 23:36:50,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-13 23:36:50,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-13 23:36:51,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:51,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-11-13 23:36:52,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:52,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-13 23:36:54,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:54,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-13 23:36:55,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:55,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-11-13 23:36:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 333 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-13 23:36:56,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:36:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:36:58,391 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:36:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681664645] [2024-11-13 23:36:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681664645] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 23:36:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:36:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2024-11-13 23:36:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867729035] [2024-11-13 23:36:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:36:58,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:36:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:36:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:36:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:36:58,393 INFO L87 Difference]: Start difference. First operand 566 states and 805 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:37:02,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:37:04,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:37:07,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:37:09,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:37:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:12,251 INFO L93 Difference]: Finished difference Result 1131 states and 1608 transitions. [2024-11-13 23:37:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:37:12,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-13 23:37:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:12,254 INFO L225 Difference]: With dead ends: 1131 [2024-11-13 23:37:12,255 INFO L226 Difference]: Without dead ends: 568 [2024-11-13 23:37:12,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:37:12,257 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 132 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:12,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 495 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 317 Invalid, 4 Unknown, 0 Unchecked, 13.7s Time] [2024-11-13 23:37:12,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-13 23:37:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 562. [2024-11-13 23:37:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 513 states have (on average 1.3859649122807018) internal successors, (711), 515 states have internal predecessors, (711), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:37:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 799 transitions. [2024-11-13 23:37:12,301 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 799 transitions. Word has length 143 [2024-11-13 23:37:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:12,301 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 799 transitions. [2024-11-13 23:37:12,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:37:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 799 transitions. [2024-11-13 23:37:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 23:37:12,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:12,304 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:37:12,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-13 23:37:12,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:37:12,505 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:12,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:12,506 INFO L85 PathProgramCache]: Analyzing trace with hash -696769973, now seen corresponding path program 1 times [2024-11-13 23:37:12,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:37:12,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233903372] [2024-11-13 23:37:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:12,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:37:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:37:12,508 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:37:12,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-13 23:37:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:14,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:37:14,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:37:14,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:37:14,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 21 [2024-11-13 23:37:15,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:15,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 59 [2024-11-13 23:37:18,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:18,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 82 [2024-11-13 23:37:24,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:24,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 89 [2024-11-13 23:37:30,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:30,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 88 [2024-11-13 23:37:32,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:32,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 88 [2024-11-13 23:37:33,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:33,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 88 [2024-11-13 23:37:35,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:35,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 98 [2024-11-13 23:37:37,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:37,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 111 [2024-11-13 23:37:40,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:40,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 124 [2024-11-13 23:37:44,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:44,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-13 23:37:48,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 118 [2024-11-13 23:37:48,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:37:48,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:48,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 216 [2024-11-13 23:37:48,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:37:48,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 101 [2024-11-13 23:37:52,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:52,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 265 treesize of output 183 [2024-11-13 23:37:56,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:37:56,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 280 treesize of output 112 [2024-11-13 23:37:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 276 proven. 112 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-13 23:37:56,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:37:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 23:37:59,794 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:37:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233903372] [2024-11-13 23:37:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233903372] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 23:37:59,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:37:59,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2024-11-13 23:37:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847984280] [2024-11-13 23:37:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:59,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:37:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:37:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:37:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=127, Unknown=5, NotChecked=0, Total=182 [2024-11-13 23:37:59,797 INFO L87 Difference]: Start difference. First operand 562 states and 799 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:38:04,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:38:06,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:38:08,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:38:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:11,629 INFO L93 Difference]: Finished difference Result 1123 states and 1598 transitions. [2024-11-13 23:38:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:38:11,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-13 23:38:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:11,641 INFO L225 Difference]: With dead ends: 1123 [2024-11-13 23:38:11,641 INFO L226 Difference]: Without dead ends: 564 [2024-11-13 23:38:11,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=54, Invalid=151, Unknown=5, NotChecked=0, Total=210 [2024-11-13 23:38:11,643 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 125 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:11,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 385 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 261 Invalid, 3 Unknown, 0 Unchecked, 11.7s Time] [2024-11-13 23:38:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-13 23:38:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 559. [2024-11-13 23:38:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 510 states have (on average 1.384313725490196) internal successors, (706), 512 states have internal predecessors, (706), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:38:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 794 transitions. [2024-11-13 23:38:11,683 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 794 transitions. Word has length 143 [2024-11-13 23:38:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:11,683 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 794 transitions. [2024-11-13 23:38:11,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 23:38:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 794 transitions. [2024-11-13 23:38:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 23:38:11,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:11,686 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:11,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-13 23:38:11,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:38:11,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:11,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:11,887 INFO L85 PathProgramCache]: Analyzing trace with hash -683566956, now seen corresponding path program 1 times [2024-11-13 23:38:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:38:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431793710] [2024-11-13 23:38:11,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:38:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:38:11,890 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:38:11,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2c843aa-aeb5-4f3f-8569-5f2b3ebc8496/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 (18)] Waiting until timeout for monitored process [2024-11-13 23:38:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:13,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-13 23:38:13,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:38:13,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:13,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:13,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:13,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:13,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:14,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:14,475 INFO L224 Elim1Store]: Index analysis took 916 ms [2024-11-13 23:38:14,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 61 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 41 [2024-11-13 23:38:15,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 95 [2024-11-13 23:38:23,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:23,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 222 treesize of output 159 [2024-11-13 23:38:32,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:32,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 262 treesize of output 192 [2024-11-13 23:38:38,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:38,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 187 treesize of output 147 [2024-11-13 23:38:41,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:41,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 187 treesize of output 147 [2024-11-13 23:38:45,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:45,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 187 treesize of output 147 [2024-11-13 23:38:50,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:50,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 182 treesize of output 148 [2024-11-13 23:38:55,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:55,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 182 treesize of output 148 [2024-11-13 23:38:59,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:59,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-13 23:39:03,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:39:03,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 118 [2024-11-13 23:39:12,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 110 [2024-11-13 23:39:12,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:39:12,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:39:12,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 198 [2024-11-13 23:39:13,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2024-11-13 23:39:17,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:39:17,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 397 treesize of output 327 [2024-11-13 23:39:42,337 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse12 (select .cse7 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse10 (select .cse7 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (let ((.cse19 (select .cse7 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (let ((.cse0 (exists ((|v_skolemized_q#valueAsBitvector_117| (_ BitVec 64))) (let ((.cse14 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_117|)) (.cse16 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_117|))) (and (= .cse14 (select .cse7 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (fp.leq (let ((.cse15 (concat .cse14 .cse16))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (= (select .cse7 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) .cse16))))) (.cse1 (exists ((|v_skolemized_q#valueAsBitvector_116| (_ BitVec 64))) (let ((.cse11 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_116|)) (.cse9 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_116|))) (and (= .cse9 .cse10) (= .cse11 .cse12) (fp.leq (let ((.cse13 (concat .cse11 .cse9))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))))))) (.cse2 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse8)) (.cse3 (select .cse7 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_33| (_ BitVec 8))) (= (select .cse7 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_33|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_33| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_33|) (select .cse7 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet88#1_31| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet88#1_31|) (select .cse7 (bvadd (_ bv32 32) |c_~#WrapperStruct00~0.offset|)))))) (or (and .cse0 .cse1 .cse2 (= .cse3 ((_ sign_extend 24) (_ bv0 8))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= .cse3 ((_ sign_extend 24) (_ bv1 8))) .cse4 .cse5 .cse6))) (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse17 (concat .cse12 .cse10))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven .cse8))) (fp.mul roundNearestTiesToEven .cse18 (fp.mul roundNearestTiesToEven .cse18 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))))))))) is different from false [2024-11-13 23:39:44,391 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse12 (select .cse7 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse10 (select .cse7 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (let ((.cse19 (select .cse7 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (let ((.cse0 (exists ((|v_skolemized_q#valueAsBitvector_117| (_ BitVec 64))) (let ((.cse14 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_117|)) (.cse16 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_117|))) (and (= .cse14 (select .cse7 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (fp.leq (let ((.cse15 (concat .cse14 .cse16))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (= (select .cse7 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) .cse16))))) (.cse1 (exists ((|v_skolemized_q#valueAsBitvector_116| (_ BitVec 64))) (let ((.cse11 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_116|)) (.cse9 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_116|))) (and (= .cse9 .cse10) (= .cse11 .cse12) (fp.leq (let ((.cse13 (concat .cse11 .cse9))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))))))) (.cse2 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse8)) (.cse3 (select .cse7 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_33| (_ BitVec 8))) (= (select .cse7 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_33|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_33| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_33|) (select .cse7 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet88#1_31| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet88#1_31|) (select .cse7 (bvadd (_ bv32 32) |c_~#WrapperStruct00~0.offset|)))))) (or (and .cse0 .cse1 .cse2 (= .cse3 ((_ sign_extend 24) (_ bv0 8))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= .cse3 ((_ sign_extend 24) (_ bv1 8))) .cse4 .cse5 .cse6))) (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse17 (concat .cse12 .cse10))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven .cse8))) (fp.mul roundNearestTiesToEven .cse18 (fp.mul roundNearestTiesToEven .cse18 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))))))))) is different from true [2024-11-13 23:40:05,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:40:05,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 547 treesize of output 271 [2024-11-13 23:40:51,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0)))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_116| (_ BitVec 64)) (v_arrayElimCell_517 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_517) ((_ extract 30 23) v_arrayElimCell_517) ((_ extract 22 0) v_arrayElimCell_517))) (.cse0 (let ((.cse7 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_116|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_116|)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse4))) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 .cse3))))) (= .cse5 .cse4) (fp.leq .cse0 .cse6) (= |c_ULTIMATE.start_property_#t~mem117#1| .cse0)))) (exists ((|v_skolemized_q#valueAsBitvector_117| (_ BitVec 64))) (let ((.cse8 (let ((.cse10 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_117|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_117|)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (and (= .cse8 |c_ULTIMATE.start_property_#t~mem116#1|) (fp.leq .cse8 .cse9))))) (and (exists ((v_prenex_33 (_ BitVec 64))) (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) v_prenex_33) ((_ extract 31 0) v_prenex_33)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (and (= .cse11 |c_ULTIMATE.start_property_#t~mem116#1|) (fp.leq .cse11 .cse9)))) (exists ((v_arrayElimCell_517 (_ BitVec 32)) (v_prenex_31 (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_517) ((_ extract 30 23) v_arrayElimCell_517) ((_ extract 22 0) v_arrayElimCell_517))) (.cse13 (let ((.cse16 (concat ((_ extract 63 32) v_prenex_31) ((_ extract 31 0) v_prenex_31)))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))))) (and (fp.leq .cse13 .cse6) (= .cse5 .cse14) (not (fp.lt (fp.sub roundNearestTiesToEven .cse13 .cse1) (let ((.cse15 ((_ to_fp 11 53) roundNearestTiesToEven .cse14))) (fp.mul roundNearestTiesToEven .cse15 (fp.mul roundNearestTiesToEven .cse15 .cse3))))) (= |c_ULTIMATE.start_property_#t~mem117#1| .cse13))))))) is different from false [2024-11-13 23:40:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 1 proven. 387 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-13 23:40:53,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:41:05,421 WARN L851 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-13 23:41:07,498 WARN L873 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from true [2024-11-13 23:41:17,989 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from false [2024-11-13 23:41:20,057 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from true