./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:12:15,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:12:15,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:12:15,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:12:15,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:12:15,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:12:15,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:12:15,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:12:15,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:12:15,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:12:15,572 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:12:15,573 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:12:15,573 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:12:15,573 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:12:15,573 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:12:15,573 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:12:15,573 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:12:15,574 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:12:15,574 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:12:15,574 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:12:15,574 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:12:15,575 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:12:15,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:12:15,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:12:15,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:12:15,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:12:15,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:12:15,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:12:15,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:12:15,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:12:15,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:12:15,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:12:15,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:12:15,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:12:15,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:12:15,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:12:15,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:12:15,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:12:15,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:12:15,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:12:15,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:12:15,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:12:15,578 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:12:15,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:12:15,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:12:15,579 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:12:15,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:12:15,579 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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2024-11-14 04:12:15,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:12:15,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:12:15,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:12:15,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:12:15,948 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:12:15,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i Unable to find full path for "g++" [2024-11-14 04:12:18,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:12:18,442 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:12:18,443 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-14 04:12:18,454 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/data/caa380842/a909b8a3bd9a41939ef19205aa0784e6/FLAG77f1dbd2e [2024-11-14 04:12:18,474 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/data/caa380842/a909b8a3bd9a41939ef19205aa0784e6 [2024-11-14 04:12:18,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:12:18,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:12:18,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:12:18,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:12:18,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:12:18,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:18,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc6d327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18, skipping insertion in model container [2024-11-14 04:12:18,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:18,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:12:18,727 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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i[916,929] [2024-11-14 04:12:18,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:12:18,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:12:18,864 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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i[916,929] [2024-11-14 04:12:18,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:12:18,968 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:12:18,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18 WrapperNode [2024-11-14 04:12:18,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:12:18,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:12:18,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:12:18,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:12:18,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:18,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,064 INFO L138 Inliner]: procedures = 29, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-11-14 04:12:19,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:12:19,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:12:19,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:12:19,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:12:19,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:12:19,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:12:19,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:12:19,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:12:19,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (1/1) ... [2024-11-14 04:12:19,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:12:19,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:12:19,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:12:19,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:12:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:12:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 04:12:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:12:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 04:12:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:12:19,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 04:12:19,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:12:19,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:12:19,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:12:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:12:19,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:12:19,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:12:19,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:12:20,257 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-14 04:12:20,257 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:12:21,103 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:12:21,104 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:12:21,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:12:21 BoogieIcfgContainer [2024-11-14 04:12:21,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:12:21,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:12:21,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:12:21,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:12:21,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:12:18" (1/3) ... [2024-11-14 04:12:21,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b9bf87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:12:21, skipping insertion in model container [2024-11-14 04:12:21,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:18" (2/3) ... [2024-11-14 04:12:21,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b9bf87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:12:21, skipping insertion in model container [2024-11-14 04:12:21,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:12:21" (3/3) ... [2024-11-14 04:12:21,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2024-11-14 04:12:21,137 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:12:21,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-29.i that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:12:21,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:12:21,208 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;@69b4b097, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:12:21,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:12:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:12:21,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 04:12:21,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:12:21,220 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:12:21,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:12:21,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:12:21,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1316518783, now seen corresponding path program 1 times [2024-11-14 04:12:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:12:21,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020385350] [2024-11-14 04:12:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:12:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:12:22,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:12:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:12:23,018 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:12:23,020 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:12:23,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:12:23,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:12:23,034 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 04:12:23,105 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:12:23,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:12:23 BoogieIcfgContainer [2024-11-14 04:12:23,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:12:23,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:12:23,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:12:23,110 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:12:23,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:12:21" (3/4) ... [2024-11-14 04:12:23,115 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:12:23,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:12:23,119 INFO L158 Benchmark]: Toolchain (without parser) took 4638.13ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 67.3MB in the end (delta: 25.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-11-14 04:12:23,120 INFO L158 Benchmark]: CDTParser took 1.20ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:12:23,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.53ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 78.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:12:23,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.02ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 74.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:12:23,121 INFO L158 Benchmark]: Boogie Preprocessor took 86.00ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 72.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:12:23,122 INFO L158 Benchmark]: RCFGBuilder took 1946.81ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 43.4MB in the end (delta: 28.7MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-14 04:12:23,123 INFO L158 Benchmark]: TraceAbstraction took 2001.50ms. Allocated memory is still 117.4MB. Free memory was 42.9MB in the beginning and 68.4MB in the end (delta: -25.5MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-14 04:12:23,126 INFO L158 Benchmark]: Witness Printer took 5.60ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 67.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:12:23,128 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.20ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.53ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 78.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.02ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 74.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.00ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 72.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1946.81ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 43.4MB in the end (delta: 28.7MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2001.50ms. Allocated memory is still 117.4MB. Free memory was 42.9MB in the beginning and 68.4MB in the end (delta: -25.5MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Witness Printer took 5.60ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 67.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 42, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someUnaryFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] float_Array_0[0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L68] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] float_Array_0[1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L70] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L72] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET updateVariables() [L87] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1] [L37] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L38] EXPR unsigned_char_Array_0[1] [L38] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L39] BOOL_unsigned_char_Array_0[0] [L39] COND TRUE BOOL_unsigned_char_Array_0[0] [L40] EXPR float_Array_0[1] [L40] float_Array_0[2] = float_Array_0[1] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[1] [L46] COND FALSE !((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) [L49] EXPR unsigned_char_Array_0[2] [L49] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] [L51] signed long int stepLocal_0 = 5 * unsigned_char_Array_0[2]; [L52] EXPR float_Array_0[1] [L52] EXPR float_Array_0[2] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) [L52] EXPR float_Array_0[2] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) [L52] EXPR float_Array_0[2] [L52] COND FALSE !(((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) [L59] EXPR float_Array_0[2] [L59] EXPR float_Array_0[1] [L59] COND FALSE !(float_Array_0[2] < float_Array_0[1]) [L87] RET step() [L88] CALL, EXPR property() [L78] EXPR BOOL_unsigned_char_Array_0[0] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) [L78] EXPR float_Array_0[2] [L78] EXPR float_Array_0[1] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) [L78-L79] return (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 1, TraceHistogramMax: 6, 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=21occurred 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, 1.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 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-14 04:12:23,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:12:26,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:12:26,617 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 04:12:26,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:12:26,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:12:26,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:12:26,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:12:26,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:12:26,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:12:26,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:12:26,675 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:12:26,676 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:12:26,676 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:12:26,676 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:12:26,677 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:12:26,677 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:12:26,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:12:26,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:12:26,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:12:26,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:12:26,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:12:26,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:12:26,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:12:26,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:12:26,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:12:26,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:12:26,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:12:26,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:12:26,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:12:26,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:12:26,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:12:26,681 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:12:26,681 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:12:26,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:12:26,682 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:12:26,682 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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2024-11-14 04:12:27,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:12:27,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:12:27,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:12:27,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:12:27,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:12:27,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i Unable to find full path for "g++" [2024-11-14 04:12:29,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:12:29,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:12:29,652 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-14 04:12:29,671 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/data/c01ccd1ab/7020fff6544840e7a0eaa6a511c66ce5/FLAG47ff3d029 [2024-11-14 04:12:29,700 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/data/c01ccd1ab/7020fff6544840e7a0eaa6a511c66ce5 [2024-11-14 04:12:29,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:12:29,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:12:29,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:12:29,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:12:29,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:12:29,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:12:29" (1/1) ... [2024-11-14 04:12:29,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0a6ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:29, skipping insertion in model container [2024-11-14 04:12:29,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:12:29" (1/1) ... [2024-11-14 04:12:29,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:12:29,956 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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i[916,929] [2024-11-14 04:12:30,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:12:30,091 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:12:30,109 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_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i[916,929] [2024-11-14 04:12:30,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:12:30,241 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:12:30,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30 WrapperNode [2024-11-14 04:12:30,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:12:30,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:12:30,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:12:30,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:12:30,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,328 INFO L138 Inliner]: procedures = 33, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-11-14 04:12:30,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:12:30,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:12:30,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:12:30,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:12:30,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:12:30,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:12:30,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:12:30,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:12:30,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (1/1) ... [2024-11-14 04:12:30,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:12:30,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:12:30,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:12:30,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:12:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:12:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 04:12:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 04:12:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:12:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-14 04:12:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 04:12:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-14 04:12:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-14 04:12:30,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:12:30,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:12:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:12:30,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:12:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 04:12:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 04:12:30,646 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:12:30,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:12:39,773 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-14 04:12:39,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:12:39,793 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:12:39,796 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:12:39,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:12:39 BoogieIcfgContainer [2024-11-14 04:12:39,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:12:39,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:12:39,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:12:39,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:12:39,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:12:29" (1/3) ... [2024-11-14 04:12:39,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db56e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:12:39, skipping insertion in model container [2024-11-14 04:12:39,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:12:30" (2/3) ... [2024-11-14 04:12:39,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db56e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:12:39, skipping insertion in model container [2024-11-14 04:12:39,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:12:39" (3/3) ... [2024-11-14 04:12:39,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2024-11-14 04:12:39,833 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:12:39,836 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-29.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:12:39,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:12:39,934 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;@be81801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:12:39,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:12:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:12:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:12:39,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:12:39,953 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:12:39,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:12:39,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:12:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1749956918, now seen corresponding path program 1 times [2024-11-14 04:12:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:12:39,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39856969] [2024-11-14 04:12:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:39,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:12:39,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:12:39,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:12:39,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 04:12:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:12:40,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 04:12:40,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:12:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-14 04:12:40,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:12:40,612 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:12:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39856969] [2024-11-14 04:12:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39856969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:12:40,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:12:40,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:12:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235102643] [2024-11-14 04:12:40,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:12:40,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:12:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:12:40,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:12:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:12:40,656 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:12:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:12:40,685 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-14 04:12:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:12:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-14 04:12:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:12:40,695 INFO L225 Difference]: With dead ends: 169 [2024-11-14 04:12:40,696 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 04:12:40,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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-14 04:12:40,703 INFO L432 NwaCegarLoop]: 120 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, 120 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-14 04:12:40,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:12:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 04:12:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 04:12:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:12:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-14 04:12:40,751 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2024-11-14 04:12:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:12:40,752 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-14 04:12:40,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:12:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-14 04:12:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:12:40,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:12:40,756 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:12:40,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 04:12:40,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:12:40,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:12:40,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:12:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash -932360722, now seen corresponding path program 1 times [2024-11-14 04:12:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:12:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743803478] [2024-11-14 04:12:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:40,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:12:40,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:12:40,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:12:40,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:12:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:12:41,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:12:41,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:12:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 04:12:41,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:12:41,677 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:12:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743803478] [2024-11-14 04:12:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743803478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:12:41,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:12:41,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:12:41,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172786566] [2024-11-14 04:12:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:12:41,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:12:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:12:41,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:12:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:12:41,680 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:12:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:12:41,900 INFO L93 Difference]: Finished difference Result 172 states and 247 transitions. [2024-11-14 04:12:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:12:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 04:12:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:12:41,902 INFO L225 Difference]: With dead ends: 172 [2024-11-14 04:12:41,902 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 04:12:41,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:12:41,904 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:12:41,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:12:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 04:12:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-14 04:12:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:12:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-14 04:12:41,915 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 73 [2024-11-14 04:12:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:12:41,916 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-14 04:12:41,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:12:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-14 04:12:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:12:41,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:12:41,921 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:12:41,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 04:12:42,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:12:42,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:12:42,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:12:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash 842646640, now seen corresponding path program 1 times [2024-11-14 04:12:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:12:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152164754] [2024-11-14 04:12:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:12:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:12:42,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:12:42,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 04:12:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:12:42,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:12:42,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:12:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 04:12:42,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:12:42,785 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:12:42,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152164754] [2024-11-14 04:12:42,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152164754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:12:42,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:12:42,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:12:42,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529867675] [2024-11-14 04:12:42,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:12:42,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:12:42,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:12:42,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:12:42,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:12:42,787 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:12:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:12:43,044 INFO L93 Difference]: Finished difference Result 180 states and 253 transitions. [2024-11-14 04:12:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:12:43,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 04:12:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:12:43,052 INFO L225 Difference]: With dead ends: 180 [2024-11-14 04:12:43,052 INFO L226 Difference]: Without dead ends: 93 [2024-11-14 04:12:43,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:12:43,056 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:12:43,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:12:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-14 04:12:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-14 04:12:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:12:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-11-14 04:12:43,067 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 73 [2024-11-14 04:12:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:12:43,068 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-11-14 04:12:43,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:12:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-14 04:12:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:12:43,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:12:43,070 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:12:43,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-14 04:12:43,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:12:43,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:12:43,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:12:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash 844493682, now seen corresponding path program 1 times [2024-11-14 04:12:43,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:12:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435972279] [2024-11-14 04:12:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:12:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:12:43,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:12:43,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:12:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:12:43,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:12:43,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:12:44,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:12:44,039 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 106 treesize of output 34 [2024-11-14 04:12:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 04:12:44,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:12:44,190 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:12:44,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435972279] [2024-11-14 04:12:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435972279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:12:44,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:12:44,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:12:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932072319] [2024-11-14 04:12:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:12:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:12:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:12:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:12:44,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:12:44,196 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:12:46,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:12:48,538 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-14 04:12:50,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:12:52,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:12:55,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:12:56,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:12:58,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:13:00,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:13:02,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:13:04,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:13:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:13:05,481 INFO L93 Difference]: Finished difference Result 233 states and 324 transitions. [2024-11-14 04:13:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:13:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 04:13:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:13:05,485 INFO L225 Difference]: With dead ends: 233 [2024-11-14 04:13:05,485 INFO L226 Difference]: Without dead ends: 144 [2024-11-14 04:13:05,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:13:05,487 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 58 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:13:05,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 305 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 21.2s Time] [2024-11-14 04:13:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-14 04:13:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2024-11-14 04:13:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:13:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-11-14 04:13:05,498 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 73 [2024-11-14 04:13:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:13:05,498 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-11-14 04:13:05,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:13:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-11-14 04:13:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:13:05,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:13:05,503 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:13:05,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 04:13:05,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:13:05,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:13:05,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:13:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -743854220, now seen corresponding path program 1 times [2024-11-14 04:13:05,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:13:05,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264566084] [2024-11-14 04:13:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:13:05,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:13:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:13:05,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:13:05,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 04:13:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:13:06,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 04:13:06,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:13:07,742 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 19 treesize of output 1 [2024-11-14 04:13:09,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2024-11-14 04:13:10,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2024-11-14 04:13:10,188 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 131 treesize of output 67 [2024-11-14 04:13:10,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-14 04:13:10,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:13:10,621 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 166 treesize of output 58 [2024-11-14 04:13:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:13:10,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:13:11,378 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 32)) (v_ArrVal_95 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select |c_#memory_int| |c_~#float_Array_0~0.base|)) (.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (not (let ((.cse4 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse5 .cse4 |v_skolemized_q#valueAsBitvector_34|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_95) |c_~#float_Array_0~0.base|))) (fp.lt (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (select .cse1 .cse4))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_34|)) (let ((.cse6 (select .cse5 .cse2))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))))))) is different from false [2024-11-14 04:13:11,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 32)) (v_ArrVal_95 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_91) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_92))) (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse1 (select .cse7 |c_~#float_Array_0~0.base|))) (or (not (= (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_34|)))) (not (let ((.cse6 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (let ((.cse4 (select (store (store .cse7 |c_~#float_Array_0~0.base| (store .cse1 .cse6 |v_skolemized_q#valueAsBitvector_34|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_95) |c_~#float_Array_0~0.base|))) (fp.lt (let ((.cse3 (select .cse4 .cse2))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (let ((.cse5 (select .cse4 .cse6))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))))))) is different from false [2024-11-14 04:13:11,555 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:13:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264566084] [2024-11-14 04:13:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264566084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:13:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [844614827] [2024-11-14 04:13:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:13:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:13:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:13:11,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:13:11,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-14 04:13:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:13:13,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 04:13:13,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:13:15,301 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 15 treesize of output 1 [2024-11-14 04:13:16,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:13:17,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-11-14 04:13:18,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-14 04:13:18,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 121 [2024-11-14 04:13:37,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from false [2024-11-14 04:13:39,668 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from true [2024-11-14 04:14:04,740 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse0) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse1) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from false [2024-11-14 04:14:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:14:06,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:14:06,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [844614827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:06,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:14:06,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2024-11-14 04:14:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476769555] [2024-11-14 04:14:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:06,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:14:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:14:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:14:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=382, Unknown=10, NotChecked=172, Total=650 [2024-11-14 04:14:06,325 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:14:09,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:11,154 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-14 04:14:13,158 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-14 04:14:15,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-14 04:14:17,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-14 04:14:19,169 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-14 04:14:21,172 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-14 04:14:24,997 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (= (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.base|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (= (_ bv7 32) |c_~#unsigned_short_int_Array_0~0.base|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-14 04:14:26,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:28,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:30,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:33,004 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-14 04:14:34,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:36,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:40,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:42,352 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-14 04:14:44,356 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-14 04:14:46,360 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-14 04:14:48,364 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-14 04:14:50,367 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-14 04:14:53,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:54,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:56,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:14:58,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:00,657 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-14 04:15:02,661 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-14 04:15:05,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:07,717 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-14 04:15:12,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:13,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:15,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:17,911 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-14 04:15:19,915 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-14 04:15:22,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:24,289 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-14 04:15:26,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:28,371 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-14 04:15:31,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:32,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:34,517 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-14 04:15:36,521 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-14 04:15:38,524 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-14 04:15:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:38,956 INFO L93 Difference]: Finished difference Result 461 states and 646 transitions. [2024-11-14 04:15:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:15:38,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-14 04:15:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:38,960 INFO L225 Difference]: With dead ends: 461 [2024-11-14 04:15:38,960 INFO L226 Difference]: Without dead ends: 366 [2024-11-14 04:15:38,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=126, Invalid=483, Unknown=11, NotChecked=250, Total=870 [2024-11-14 04:15:38,967 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 457 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 48 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 842 IncrementalHoareTripleChecker+Unchecked, 88.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:38,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 749 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 769 Invalid, 32 Unknown, 842 Unchecked, 88.3s Time] [2024-11-14 04:15:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-14 04:15:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 358. [2024-11-14 04:15:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 332 states have (on average 1.3975903614457832) internal successors, (464), 334 states have internal predecessors, (464), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-14 04:15:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 506 transitions. [2024-11-14 04:15:39,017 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 506 transitions. Word has length 73 [2024-11-14 04:15:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:39,017 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 506 transitions. [2024-11-14 04:15:39,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:15:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 506 transitions. [2024-11-14 04:15:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:15:39,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:39,020 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:39,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-14 04:15:39,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 04:15:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:15:39,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:15:39,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1267195508, now seen corresponding path program 1 times [2024-11-14 04:15:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576736668] [2024-11-14 04:15:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:39,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:15:39,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:39,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:15:39,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:15:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:39,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:15:39,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:40,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 80 treesize of output 26 [2024-11-14 04:15:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 04:15:40,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:40,089 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:40,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576736668] [2024-11-14 04:15:40,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576736668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:40,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:40,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:15:40,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677504656] [2024-11-14 04:15:40,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:40,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:15:40,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:15:40,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:15:40,091 INFO L87 Difference]: Start difference. First operand 358 states and 506 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:15:42,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:43,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:46,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:48,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:50,740 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-14 04:15:52,742 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-14 04:15:54,746 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 [0] [2024-11-14 04:15:56,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:15:58,822 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-14 04:16:00,830 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-14 04:16:02,832 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 [0] [2024-11-14 04:16:04,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:16:06,958 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-14 04:16:09,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:16:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:16:10,570 INFO L93 Difference]: Finished difference Result 899 states and 1262 transitions. [2024-11-14 04:16:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:16:10,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 04:16:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:16:10,576 INFO L225 Difference]: With dead ends: 899 [2024-11-14 04:16:10,577 INFO L226 Difference]: Without dead ends: 544 [2024-11-14 04:16:10,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:16:10,579 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 54 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:16:10,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 316 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 14 Unknown, 0 Unchecked, 30.4s Time] [2024-11-14 04:16:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-14 04:16:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 358. [2024-11-14 04:16:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 332 states have (on average 1.3975903614457832) internal successors, (464), 334 states have internal predecessors, (464), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-14 04:16:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 506 transitions. [2024-11-14 04:16:10,623 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 506 transitions. Word has length 73 [2024-11-14 04:16:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:16:10,625 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 506 transitions. [2024-11-14 04:16:10,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:16:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 506 transitions. [2024-11-14 04:16:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:16:10,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:16:10,631 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:16:10,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:16:10,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:16:10,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:16:10,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:16:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash -321152394, now seen corresponding path program 1 times [2024-11-14 04:16:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:16:10,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184433219] [2024-11-14 04:16:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:16:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:16:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:16:10,835 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:16:10,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 04:16:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:16:11,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 04:16:11,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:16:12,320 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-14 04:16:13,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2024-11-14 04:16:13,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2024-11-14 04:16:14,120 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 131 treesize of output 67 [2024-11-14 04:16:14,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-14 04:16:14,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:16:14,672 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 166 treesize of output 58 [2024-11-14 04:16:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:16:14,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:16:15,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (select (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_158) |c_~#float_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.eq .cse0 .cse0))) is different from false [2024-11-14 04:16:15,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_49| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_49|)) (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (let ((.cse2 (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (select (select (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse1 .cse4 |v_skolemized_q#valueAsBitvector_49|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_158) |c_~#float_Array_0~0.base|) .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.eq .cse2 .cse2))))) is different from false [2024-11-14 04:16:15,523 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:16:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184433219] [2024-11-14 04:16:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184433219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:16:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [479765357] [2024-11-14 04:16:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:16:15,524 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:16:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:16:15,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:16:15,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-14 04:16:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:16:16,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 04:16:17,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:16:18,008 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 19 treesize of output 1 [2024-11-14 04:16:18,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-14 04:16:19,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2024-11-14 04:16:19,725 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 101 treesize of output 55 [2024-11-14 04:16:19,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 69 [2024-11-14 04:16:20,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:16:20,342 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 136 treesize of output 46 [2024-11-14 04:16:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:16:20,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:16:20,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (select (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_181) |c_~#float_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.eq .cse0 .cse0))) is different from false [2024-11-14 04:16:20,636 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_55| (_ BitVec 32)) (v_ArrVal_181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (select (select (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse2 .cse3 |v_skolemized_q#valueAsBitvector_55|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_181) |c_~#float_Array_0~0.base|) .cse3)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.eq .cse0 .cse0)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_55|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_55|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_55|)) (let ((.cse4 (select .cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))))) is different from false [2024-11-14 04:16:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [479765357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:16:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954499996] [2024-11-14 04:16:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:16:20,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:16:20,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:16:20,992 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:16:20,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 04:16:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:16:26,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 04:16:26,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:16:26,921 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 19 treesize of output 1 [2024-11-14 04:16:27,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2024-11-14 04:16:28,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2024-11-14 04:16:28,224 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 131 treesize of output 67 [2024-11-14 04:16:28,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-14 04:16:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:16:28,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:16:28,964 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_61| (_ BitVec 32)) (v_ArrVal_204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (select (select (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse2 .cse3 |v_skolemized_q#valueAsBitvector_61|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_204) |c_~#float_Array_0~0.base|) .cse3)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.eq .cse0 .cse0)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_61|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_61|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_61|)) (let ((.cse4 (select .cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))))) is different from false [2024-11-14 04:16:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954499996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:16:29,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:16:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2024-11-14 04:16:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439101039] [2024-11-14 04:16:29,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:16:29,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 04:16:29,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:16:29,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 04:16:29,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=587, Unknown=22, NotChecked=270, Total=992 [2024-11-14 04:16:29,329 INFO L87 Difference]: Start difference. First operand 358 states and 506 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 20 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 04:16:33,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:16:35,431 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 [0] [2024-11-14 04:16:38,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:16:40,251 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 [0] [2024-11-14 04:16:42,255 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-14 04:16:44,264 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-14 04:16:47,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:16:49,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:16:51,349 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-14 04:16:53,352 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-14 04:16:54,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:16:57,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:16:58,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:02,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:04,586 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 [0] [2024-11-14 04:17:05,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:09,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:11,156 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-14 04:17:12,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:14,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:16,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:19,685 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-14 04:17:22,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:24,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:26,625 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-14 04:17:29,512 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-14 04:17:31,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:34,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:36,385 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-14 04:17:39,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:17:41,441 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-14 04:17:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:17:43,295 INFO L93 Difference]: Finished difference Result 886 states and 1249 transitions. [2024-11-14 04:17:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 04:17:43,296 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 20 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2024-11-14 04:17:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:17:43,299 INFO L225 Difference]: With dead ends: 886 [2024-11-14 04:17:43,300 INFO L226 Difference]: Without dead ends: 531 [2024-11-14 04:17:43,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 269 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=210, Invalid=910, Unknown=22, NotChecked=340, Total=1482 [2024-11-14 04:17:43,302 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 712 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 81 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:17:43,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 626 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 808 Invalid, 23 Unknown, 0 Unchecked, 72.9s Time] [2024-11-14 04:17:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-14 04:17:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 523. [2024-11-14 04:17:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 486 states have (on average 1.3909465020576133) internal successors, (676), 490 states have internal predecessors, (676), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-14 04:17:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 736 transitions. [2024-11-14 04:17:43,341 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 736 transitions. Word has length 73 [2024-11-14 04:17:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:17:43,341 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 736 transitions. [2024-11-14 04:17:43,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 20 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 04:17:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 736 transitions. [2024-11-14 04:17:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:17:43,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:17:43,343 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:17:43,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-14 04:17:43,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-11-14 04:17:43,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 04:17:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:17:43,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:17:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:17:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1096942602, now seen corresponding path program 1 times [2024-11-14 04:17:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:17:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701917417] [2024-11-14 04:17:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:17:43,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:17:43,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:17:43,950 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:17:43,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:17:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:17:44,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:17:44,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:17:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:17:44,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:17:44,315 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:17:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701917417] [2024-11-14 04:17:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701917417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:17:44,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:17:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:17:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017212468] [2024-11-14 04:17:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:17:44,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:17:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:17:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:17:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:17:44,317 INFO L87 Difference]: Start difference. First operand 523 states and 736 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:17:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:17:44,415 INFO L93 Difference]: Finished difference Result 1043 states and 1469 transitions. [2024-11-14 04:17:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:17:44,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-14 04:17:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:17:44,420 INFO L225 Difference]: With dead ends: 1043 [2024-11-14 04:17:44,420 INFO L226 Difference]: Without dead ends: 523 [2024-11-14 04:17:44,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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-14 04:17:44,422 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:17:44,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:17:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-14 04:17:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2024-11-14 04:17:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 486 states have (on average 1.3868312757201646) internal successors, (674), 490 states have internal predecessors, (674), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-14 04:17:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 734 transitions. [2024-11-14 04:17:44,459 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 734 transitions. Word has length 73 [2024-11-14 04:17:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:17:44,460 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 734 transitions. [2024-11-14 04:17:44,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:17:44,460 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 734 transitions. [2024-11-14 04:17:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:17:44,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:17:44,462 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:17:44,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:17:44,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:17:44,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:17:44,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:17:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash 298353468, now seen corresponding path program 1 times [2024-11-14 04:17:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:17:44,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855912646] [2024-11-14 04:17:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:17:44,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:17:44,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:17:44,665 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:17:44,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:17:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:17:45,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 04:17:45,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:17:46,087 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 19 treesize of output 1 [2024-11-14 04:17:46,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2024-11-14 04:17:47,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2024-11-14 04:17:47,726 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 131 treesize of output 67 [2024-11-14 04:17:47,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-14 04:17:48,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:17:48,452 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 166 treesize of output 58 [2024-11-14 04:17:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:17:48,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:17:49,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_244) |c_~#float_Array_0~0.base|))) (fp.lt (let ((.cse0 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-14 04:17:49,461 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_71| (_ BitVec 32))) (let ((.cse5 (select |c_#memory_int| |c_~#float_Array_0~0.base|)) (.cse4 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (not (let ((.cse2 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse5 .cse2 |v_skolemized_q#valueAsBitvector_71|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_244) |c_~#float_Array_0~0.base|))) (fp.lt (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (select .cse1 .cse4))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_71|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_71|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_71|)) (let ((.cse6 (select .cse5 .cse4))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))))))) is different from false [2024-11-14 04:17:49,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_71| (_ BitVec 32)) (v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_242) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_241))) (let ((.cse6 (select .cse5 |c_~#float_Array_0~0.base|)) (.cse4 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (not (let ((.cse2 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse5 |c_~#float_Array_0~0.base| (store .cse6 .cse2 |v_skolemized_q#valueAsBitvector_71|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_244) |c_~#float_Array_0~0.base|))) (fp.lt (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (select .cse1 .cse4))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_71|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_71|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_71|)) (let ((.cse7 (select .cse6 .cse4))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))))) is different from false [2024-11-14 04:17:49,625 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:17:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855912646] [2024-11-14 04:17:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855912646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:17:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [589990560] [2024-11-14 04:17:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:17:49,625 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:17:49,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:17:49,628 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:17:49,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-14 04:17:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:17:51,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 04:17:51,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:17:53,317 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 15 treesize of output 1 [2024-11-14 04:17:54,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:17:55,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-11-14 04:17:56,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-14 04:17:56,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 121 [2024-11-14 04:18:15,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from false [2024-11-14 04:18:44,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse0) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse1) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from false [2024-11-14 04:19:16,031 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= |c_ULTIMATE.start_step_#t~ite30#1| .cse0) (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from true [2024-11-14 04:20:04,537 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_28| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_28|)) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from false [2024-11-14 04:20:06,561 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_28| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_28|)) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from true [2024-11-14 04:21:13,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse1 (let ((.cse4 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse0 (let ((.cse2 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (= |c_ULTIMATE.start_step_#t~mem37#1| .cse1) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_28| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_28|)) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= |c_ULTIMATE.start_step_#t~mem36#1| .cse0)))) is different from false [2024-11-14 04:21:15,167 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse1 (let ((.cse4 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse0 (let ((.cse2 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (= |c_ULTIMATE.start_step_#t~mem37#1| .cse1) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_28| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_28|)) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= |c_ULTIMATE.start_step_#t~mem36#1| .cse0)))) is different from true [2024-11-14 04:21:15,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 163 [2024-11-14 04:21:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:21:15,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:21:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [589990560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:21:15,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:21:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 24 [2024-11-14 04:21:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099729558] [2024-11-14 04:21:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:21:15,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 04:21:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:21:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 04:21:15,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=427, Unknown=10, NotChecked=392, Total=930 [2024-11-14 04:21:15,274 INFO L87 Difference]: Start difference. First operand 523 states and 734 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:21:18,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:20,801 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-14 04:21:22,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:24,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:26,461 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-14 04:21:28,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:29,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:31,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (= (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.base|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (= (_ bv7 32) |c_~#unsigned_short_int_Array_0~0.base|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-14 04:21:33,780 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (= (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.base|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv6 32) |c_~#unsigned_char_Array_0~0.base|) (= (_ bv7 32) |c_~#unsigned_short_int_Array_0~0.base|) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-14 04:21:35,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:37,842 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-14 04:21:39,845 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-14 04:21:42,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:44,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:48,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:50,673 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-14 04:21:53,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:55,097 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-14 04:21:56,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:21:58,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:00,346 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-14 04:22:02,349 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-14 04:22:03,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:05,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:07,953 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-14 04:22:09,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:11,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:13,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:15,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:17,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:19,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:23,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:25,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:27,439 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-14 04:22:30,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:31,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:33,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:35,578 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-14 04:22:39,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:41,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:22:43,288 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-14 04:22:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:22:43,928 INFO L93 Difference]: Finished difference Result 796 states and 1111 transitions. [2024-11-14 04:22:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 04:22:43,929 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2024-11-14 04:22:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:22:43,933 INFO L225 Difference]: With dead ends: 796 [2024-11-14 04:22:43,933 INFO L226 Difference]: Without dead ends: 536 [2024-11-14 04:22:43,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=141, Invalid=533, Unknown=12, NotChecked=504, Total=1190 [2024-11-14 04:22:43,935 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 362 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 29 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 2179 IncrementalHoareTripleChecker+Unchecked, 84.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:22:43,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 880 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 880 Invalid, 27 Unknown, 2179 Unchecked, 84.0s Time] [2024-11-14 04:22:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-14 04:22:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 526. [2024-11-14 04:22:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 489 states have (on average 1.3865030674846626) internal successors, (678), 493 states have internal predecessors, (678), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-14 04:22:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 738 transitions. [2024-11-14 04:22:43,978 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 738 transitions. Word has length 74 [2024-11-14 04:22:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:22:43,979 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 738 transitions. [2024-11-14 04:22:43,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:22:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 738 transitions. [2024-11-14 04:22:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:22:43,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:22:43,981 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:22:43,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-14 04:22:44,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:22:44,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:22:44,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:22:44,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:22:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1289994434, now seen corresponding path program 1 times [2024-11-14 04:22:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:22:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386192581] [2024-11-14 04:22:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:22:44,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:22:44,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:22:44,386 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:22:44,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/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-14 04:22:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:22:44,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:22:44,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:22:46,033 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 19 treesize of output 1 [2024-11-14 04:22:47,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2024-11-14 04:22:47,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2024-11-14 04:22:47,875 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 131 treesize of output 67 [2024-11-14 04:22:48,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-14 04:22:49,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:22:49,130 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 224 treesize of output 80 [2024-11-14 04:22:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:22:49,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:22:51,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~ite30#1| (_ FloatingPoint 8 24)) (v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_294) |c_~#float_Array_0~0.base|))) (let ((.cse0 (let ((.cse4 (select .cse3 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (or (not (fp.eq |ULTIMATE.start_step_#t~ite30#1| .cse0)) (fp.lt .cse1 .cse0) (fp.lt .cse0 .cse1) (fp.eq .cse0 .cse1))))) is different from false [2024-11-14 04:22:51,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite30#1| (_ FloatingPoint 8 24)) (v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_int| |c_~#float_Array_0~0.base|)) (.cse8 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (let ((.cse4 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse6 (select (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse3 .cse8 |v_skolemized_q#valueAsBitvector_83|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_294) |c_~#float_Array_0~0.base|))) (let ((.cse1 (let ((.cse7 (select .cse6 .cse8))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse0 (let ((.cse5 (select .cse6 .cse4))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.lt .cse0 .cse1) (not (fp.eq |ULTIMATE.start_step_#t~ite30#1| .cse1)) (fp.lt .cse1 .cse0) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_83|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_83|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_83|)) (let ((.cse2 (select .cse3 .cse4))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.eq .cse1 .cse0)))))) is different from false [2024-11-14 04:22:52,328 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 32)) (v_ArrVal_291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite30#1| (_ FloatingPoint 8 24)) (v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_291) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_292))) (let ((.cse3 (select .cse9 |c_~#float_Array_0~0.base|)) (.cse8 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (let ((.cse4 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse6 (select (store (store .cse9 |c_~#float_Array_0~0.base| (store .cse3 .cse8 |v_skolemized_q#valueAsBitvector_83|)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_294) |c_~#float_Array_0~0.base|))) (let ((.cse1 (let ((.cse7 (select .cse6 .cse8))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse0 (let ((.cse5 (select .cse6 .cse4))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.lt .cse0 .cse1) (not (= (let ((.cse2 (select .cse3 .cse4))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_83|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_83|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_83|)))) (fp.lt .cse1 .cse0) (not (fp.eq |ULTIMATE.start_step_#t~ite30#1| .cse1)) (fp.eq .cse1 .cse0))))))) is different from false [2024-11-14 04:22:52,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:22:52,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386192581] [2024-11-14 04:22:52,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386192581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:22:52,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1050727654] [2024-11-14 04:22:52,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:22:52,617 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:22:52,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:22:52,620 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:22:52,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa4aeba-5580-4dc9-a4c7-a4ea628f87f0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-14 04:22:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:22:54,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 04:22:54,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:22:56,253 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 15 treesize of output 1 [2024-11-14 04:22:58,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:22:59,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-11-14 04:22:59,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-14 04:23:00,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 121 [2024-11-14 04:23:17,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from false [2024-11-14 04:23:19,323 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from true [2024-11-14 04:23:46,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse0) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse1) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from false [2024-11-14 04:23:48,989 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse0) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse1) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from true [2024-11-14 04:24:19,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= |c_ULTIMATE.start_step_#t~ite30#1| .cse0) (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from false [2024-11-14 04:24:21,098 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= |c_ULTIMATE.start_step_#t~ite30#1| .cse0) (= .cse0 .cse1) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from true [2024-11-14 04:25:11,122 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (let ((.cse4 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse1 (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_33| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_33|)) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) is different from true [2024-11-14 04:26:05,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse1 (let ((.cse4 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse0 (let ((.cse2 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_33| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_33|)) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= |c_ULTIMATE.start_step_#t~mem37#1| .cse1) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= |c_ULTIMATE.start_step_#t~mem36#1| .cse0)))) is different from false [2024-11-14 04:26:07,337 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse1 (let ((.cse4 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (.cse0 (let ((.cse2 (select .cse3 (_ bv8 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= .cse0 .cse1) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_33| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_33|)) (= (_ bv0 32) |c_~#float_Array_0~0.offset|) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= |c_ULTIMATE.start_step_#t~mem37#1| .cse1) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (= (_ bv5 32) |c_~#float_Array_0~0.base|) (fp.leq .cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= |c_ULTIMATE.start_step_#t~mem36#1| .cse0)))) is different from true [2024-11-14 04:26:57,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 123