./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 41f77efcfe33be11618a361f7eb55ba9d9569bca80921eb0046d4538ba494080 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:18:53,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:18:53,980 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:18:53,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:18:53,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:18:54,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:18:54,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:18:54,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:18:54,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:18:54,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:18:54,027 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:18:54,028 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:18:54,028 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:18:54,028 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:18:54,028 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:18:54,028 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:18:54,028 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:18:54,028 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:18:54,029 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:18:54,029 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:18:54,029 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:18:54,029 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:18:54,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:18:54,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:18:54,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:18:54,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:18:54,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:18:54,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:18:54,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:18:54,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:18:54,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:18:54,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:18:54,030 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:18:54,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:18:54,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:18:54,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:18:54,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:18:54,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:18:54,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:18:54,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:18:54,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:18:54,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:18:54,032 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:18:54,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:18:54,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:18:54,032 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:18:54,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:18:54,032 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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 -> 41f77efcfe33be11618a361f7eb55ba9d9569bca80921eb0046d4538ba494080 [2024-11-14 04:18:54,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:18:54,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:18:54,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:18:54,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:18:54,386 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:18:54,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i Unable to find full path for "g++" [2024-11-14 04:18:56,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:18:56,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:18:56,672 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i [2024-11-14 04:18:56,686 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/data/b779c1f9a/46de781000bd4a1193e53a733021af43/FLAGd341206e8 [2024-11-14 04:18:56,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/data/b779c1f9a/46de781000bd4a1193e53a733021af43 [2024-11-14 04:18:56,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:18:56,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:18:56,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:18:56,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:18:56,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:18:56,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:18:56" (1/1) ... [2024-11-14 04:18:56,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d445cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:56, skipping insertion in model container [2024-11-14 04:18:56,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:18:56" (1/1) ... [2024-11-14 04:18:56,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:18:56,922 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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i[916,929] [2024-11-14 04:18:57,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:18:57,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:18:57,041 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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i[916,929] [2024-11-14 04:18:57,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:18:57,105 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:18:57,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57 WrapperNode [2024-11-14 04:18:57,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:18:57,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:18:57,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:18:57,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:18:57,114 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:18:57" (1/1) ... [2024-11-14 04:18:57,133 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:18:57" (1/1) ... [2024-11-14 04:18:57,182 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 557 [2024-11-14 04:18:57,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:18:57,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:18:57,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:18:57,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:18:57,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:18:57,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:18:57,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:18:57,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:18:57,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (1/1) ... [2024-11-14 04:18:57,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:18:57,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:18:57,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:18:57,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:18:57,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:18:57,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 04:18:57,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:18:57,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 04:18:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:18:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 04:18:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:18:57,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:18:57,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:18:57,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:18:57,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:18:57,500 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:18:57,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:18:58,286 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-14 04:18:58,286 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:18:59,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:18:59,069 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:18:59,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:18:59 BoogieIcfgContainer [2024-11-14 04:18:59,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:18:59,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:18:59,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:18:59,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:18:59,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:18:56" (1/3) ... [2024-11-14 04:18:59,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5a1483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:18:59, skipping insertion in model container [2024-11-14 04:18:59,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:18:57" (2/3) ... [2024-11-14 04:18:59,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5a1483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:18:59, skipping insertion in model container [2024-11-14 04:18:59,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:18:59" (3/3) ... [2024-11-14 04:18:59,086 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-36.i [2024-11-14 04:18:59,103 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:18:59,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-36.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:18:59,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:18:59,188 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;@11c61990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:18:59,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:18:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:18:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-14 04:18:59,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:18:59,204 INFO L215 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:59,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:18:59,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:18:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 376937086, now seen corresponding path program 1 times [2024-11-14 04:18:59,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:18:59,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77340993] [2024-11-14 04:18:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:18:59,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:19:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:19:00,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:19:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:19:01,317 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:19:01,321 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:19:01,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:19:01,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:19:01,329 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 04:19:01,418 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:19:01,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:19:01 BoogieIcfgContainer [2024-11-14 04:19:01,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:19:01,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:19:01,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:19:01,426 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:19:01,427 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:18:59" (3/4) ... [2024-11-14 04:19:01,429 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:19:01,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:19:01,434 INFO L158 Benchmark]: Toolchain (without parser) took 4718.74ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.7MB in the beginning and 72.7MB in the end (delta: 20.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2024-11-14 04:19:01,435 INFO L158 Benchmark]: CDTParser took 1.96ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:19:01,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.47ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 77.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:19:01,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.25ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 73.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:19:01,438 INFO L158 Benchmark]: Boogie Preprocessor took 72.18ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 70.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:19:01,438 INFO L158 Benchmark]: RCFGBuilder took 1811.16ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 72.9MB in the end (delta: -2.6MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-14 04:19:01,438 INFO L158 Benchmark]: TraceAbstraction took 2351.23ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 72.2MB in the beginning and 72.7MB in the end (delta: -528.6kB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2024-11-14 04:19:01,439 INFO L158 Benchmark]: Witness Printer took 6.42ms. Allocated memory is still 159.4MB. Free memory was 72.7MB in the beginning and 72.7MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:19:01,442 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.96ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.47ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 77.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.25ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 73.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.18ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 70.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1811.16ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 72.9MB in the end (delta: -2.6MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2351.23ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 72.2MB in the beginning and 72.7MB in the end (delta: -528.6kB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Witness Printer took 6.42ms. Allocated memory is still 159.4MB. Free memory was 72.7MB in the beginning and 72.7MB in the end (delta: 19.6kB). 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 shiftRight at line 41, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someUnaryDOUBLEoperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L25-L27] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L28-L30] float float_Array_0[2] = { 4.25, 9999999999.875 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L37] unsigned char last_1_unsigned_char_Array_0_1_ = 1; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] EXPR unsigned_char_Array_0[1] [L95] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] double_Array_0[0][0] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[0][0] [L81] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F [L81] EXPR double_Array_0[0][0] [L81] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F [L81] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] double_Array_0[1][0] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[1][0] [L83] EXPR double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F [L83] EXPR (double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) [L83] EXPR double_Array_0[1][0] [L83] EXPR double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F [L83] EXPR double_Array_0[1][0] [L83] EXPR double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F [L83] EXPR (double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not((double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not((double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] double_Array_0[1][1] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F [L85] EXPR (double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F ) [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F [L85] EXPR (double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] float_Array_0[0] = __VERIFIER_nondet_float() [L87] EXPR float_Array_0[0] [L87] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L87] 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 ) [L87] EXPR float_Array_0[0] [L87] EXPR float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F [L87] EXPR float_Array_0[0] [L87] EXPR float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F [L87] 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] 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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L87] 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] float_Array_0[1] = __VERIFIER_nondet_float() [L89] EXPR float_Array_0[1] [L89] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L89] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) [L89] EXPR float_Array_0[1] [L89] EXPR float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F [L89] EXPR float_Array_0[1] [L89] EXPR float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F [L89] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] RET updateVariables() [L107] CALL step() [L41] EXPR last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_ [L41] COND FALSE !((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) [L44] EXPR double_Array_0[1][0] [L44] EXPR double_Array_0[0][0] [L44] COND TRUE double_Array_0[1][0] == (- double_Array_0[0][0]) [L45] EXPR BOOL_unsigned_char_Array_0[1] [L45] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1] [L45] EXPR BOOL_unsigned_char_Array_0[1] [L45] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1] [L45] COND TRUE BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1] [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L53] EXPR float_Array_0[0] [L53] EXPR float_Array_0[1] [L53] COND TRUE float_Array_0[0] > float_Array_0[1] [L54] double_Array_0[0][1] = 4.6 [L58] EXPR double_Array_0[0][1] [L58] EXPR double_Array_0[0][1] [L58] unsigned char stepLocal_0 = double_Array_0[0][1] > double_Array_0[0][1]; [L59] stepLocal_0 && BOOL_unsigned_char_Array_0[1] [L59] COND FALSE !(stepLocal_0 && BOOL_unsigned_char_Array_0[1]) [L70] EXPR unsigned_char_Array_0[1] [L70] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[1] [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR double_Array_0[0][1] [L98] EXPR double_Array_0[0][1] [L98] EXPR (double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] [L98] EXPR (double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1] [L98] EXPR ((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) [L98] EXPR double_Array_0[0][1] [L98] EXPR double_Array_0[0][1] [L98] EXPR ((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])) [L98] EXPR double_Array_0[0][1] [L98] EXPR ((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])) [L98] EXPR double_Array_0[0][1] [L98] EXPR (((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) [L98] EXPR BOOL_unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) [L98] EXPR unsigned_long_int_Array_0[0] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) [L98] EXPR (((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) [L98] EXPR ((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) [L98] EXPR (((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1) [L98] EXPR last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_ [L98] EXPR ((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1 [L98] EXPR (((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1) [L98] EXPR ((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))))))) [L98] EXPR float_Array_0[0] [L98] EXPR float_Array_0[1] [L98] EXPR (float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0])))))))) [L98] EXPR double_Array_0[0][1] [L98] EXPR (float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0])))))))) [L98] EXPR ((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))))))) [L98] EXPR (((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0])))))))))) && ((double_Array_0[1][0] == (- double_Array_0[0][0])) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) 0))) [L98] EXPR double_Array_0[1][0] [L98] EXPR double_Array_0[0][0] [L98] EXPR (double_Array_0[1][0] == (- double_Array_0[0][0])) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) 0)) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR (double_Array_0[1][0] == (- double_Array_0[0][0])) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) 0)) [L98] EXPR (((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0])))))))))) && ((double_Array_0[1][0] == (- double_Array_0[0][0])) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) 0))) [L98-L99] return (((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0])))))))))) && ((double_Array_0[1][0] == (- double_Array_0[0][0])) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) 0))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 1, TraceHistogramMax: 11, 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=31occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 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:19:01,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 41f77efcfe33be11618a361f7eb55ba9d9569bca80921eb0046d4538ba494080 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:19:04,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:19:04,288 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 04:19:04,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:19:04,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:19:04,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:19:04,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:19:04,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:19:04,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:19:04,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:19:04,323 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:19:04,323 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:19:04,323 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:19:04,323 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:19:04,324 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:19:04,324 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:19:04,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:19:04,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:19:04,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:19:04,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:19:04,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:19:04,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:19:04,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:19:04,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:19:04,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:19:04,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:19:04,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:19:04,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:19:04,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:19:04,328 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:19:04,328 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:19:04,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:19:04,328 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:19:04,328 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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 -> 41f77efcfe33be11618a361f7eb55ba9d9569bca80921eb0046d4538ba494080 [2024-11-14 04:19:04,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:19:04,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:19:04,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:19:04,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:19:04,699 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:19:04,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i Unable to find full path for "g++" [2024-11-14 04:19:06,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:19:06,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:19:06,927 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i [2024-11-14 04:19:06,936 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/data/d5d81a349/50e0fab82d894119a6634521b852f01b/FLAGe8325b910 [2024-11-14 04:19:06,951 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/data/d5d81a349/50e0fab82d894119a6634521b852f01b [2024-11-14 04:19:06,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:19:06,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:19:06,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:19:06,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:19:06,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:19:06,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:19:06" (1/1) ... [2024-11-14 04:19:06,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45634573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:06, skipping insertion in model container [2024-11-14 04:19:06,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:19:06" (1/1) ... [2024-11-14 04:19:06,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:19:07,164 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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i[916,929] [2024-11-14 04:19:07,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:19:07,280 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:19:07,295 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_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i[916,929] [2024-11-14 04:19:07,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:19:07,429 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:19:07,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07 WrapperNode [2024-11-14 04:19:07,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:19:07,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:19:07,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:19:07,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:19:07,440 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:19:07" (1/1) ... [2024-11-14 04:19:07,464 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:19:07" (1/1) ... [2024-11-14 04:19:07,525 INFO L138 Inliner]: procedures = 36, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 543 [2024-11-14 04:19:07,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:19:07,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:19:07,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:19:07,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:19:07,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:19:07,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:19:07,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:19:07,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:19:07,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (1/1) ... [2024-11-14 04:19:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:19:07,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:19:07,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:07,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:19:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-14 04:19:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-14 04:19:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 04:19:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:19:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 04:19:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-14 04:19:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-14 04:19:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 04:19:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-14 04:19:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-14 04:19:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:19:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:19:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:19:07,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:19:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 04:19:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 04:19:07,809 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:19:07,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:19:08,819 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-11-14 04:19:08,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:19:08,839 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:19:08,840 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:19:08,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:19:08 BoogieIcfgContainer [2024-11-14 04:19:08,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:19:08,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:19:08,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:19:08,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:19:08,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:19:06" (1/3) ... [2024-11-14 04:19:08,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59768974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:19:08, skipping insertion in model container [2024-11-14 04:19:08,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:07" (2/3) ... [2024-11-14 04:19:08,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59768974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:19:08, skipping insertion in model container [2024-11-14 04:19:08,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:19:08" (3/3) ... [2024-11-14 04:19:08,856 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-36.i [2024-11-14 04:19:08,873 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:19:08,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-36.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:19:08,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:19:08,985 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;@7389ef6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:19:08,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:19:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-14 04:19:09,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:09,005 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:09,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:09,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1594535544, now seen corresponding path program 1 times [2024-11-14 04:19:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:09,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687316028] [2024-11-14 04:19:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:09,030 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:19:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:09,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:09,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:09,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 04:19:09,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-14 04:19:09,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:19:09,523 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687316028] [2024-11-14 04:19:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687316028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:19:09,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:19:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:19:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706213679] [2024-11-14 04:19:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:19:09,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:19:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:19:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:19:09,559 INFO L87 Difference]: Start difference. First operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 04:19:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:09,606 INFO L93 Difference]: Finished difference Result 227 states and 355 transitions. [2024-11-14 04:19:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:19:09,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-14 04:19:09,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:09,620 INFO L225 Difference]: With dead ends: 227 [2024-11-14 04:19:09,620 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 04:19:09,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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:19:09,631 INFO L432 NwaCegarLoop]: 163 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, 163 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:19:09,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:19:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 04:19:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-14 04:19:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-11-14 04:19:09,676 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 108 [2024-11-14 04:19:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:09,677 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-11-14 04:19:09,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 04:19:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-11-14 04:19:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-14 04:19:09,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:09,684 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:09,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:09,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:09,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:09,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1494866506, now seen corresponding path program 1 times [2024-11-14 04:19:09,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:09,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876764995] [2024-11-14 04:19:09,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:09,886 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:19:09,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:09,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:09,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:10,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:19:10,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:10,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:19:10,415 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 208 treesize of output 64 [2024-11-14 04:19:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:19:10,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:19:10,453 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:10,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876764995] [2024-11-14 04:19:10,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876764995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:19:10,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:19:10,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:19:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701425667] [2024-11-14 04:19:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:19:10,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:19:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:10,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:19:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:19:10,458 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:10,511 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2024-11-14 04:19:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:19:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-14 04:19:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:10,514 INFO L225 Difference]: With dead ends: 215 [2024-11-14 04:19:10,514 INFO L226 Difference]: Without dead ends: 107 [2024-11-14 04:19:10,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:19:10,518 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:19:10,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:19:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-14 04:19:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-14 04:19:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-11-14 04:19:10,538 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 108 [2024-11-14 04:19:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:10,539 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-11-14 04:19:10,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-14 04:19:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-14 04:19:10,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:10,544 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:10,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:10,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:10,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash 215002828, now seen corresponding path program 1 times [2024-11-14 04:19:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:10,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892090648] [2024-11-14 04:19:10,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:10,747 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:19:10,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:10,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:10,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:11,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:19:11,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:19:11,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:19:11,184 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892090648] [2024-11-14 04:19:11,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892090648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:19:11,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:19:11,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:19:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022669422] [2024-11-14 04:19:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:19:11,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:19:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:19:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:19:11,187 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:11,210 INFO L93 Difference]: Finished difference Result 205 states and 296 transitions. [2024-11-14 04:19:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:19:11,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-14 04:19:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:11,213 INFO L225 Difference]: With dead ends: 205 [2024-11-14 04:19:11,213 INFO L226 Difference]: Without dead ends: 101 [2024-11-14 04:19:11,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:19:11,214 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:19:11,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:19:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-14 04:19:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-14 04:19:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-14 04:19:11,223 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 108 [2024-11-14 04:19:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:11,224 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-14 04:19:11,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-14 04:19:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-14 04:19:11,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:11,226 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:11,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 04:19:11,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:11,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash 473168266, now seen corresponding path program 1 times [2024-11-14 04:19:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776016866] [2024-11-14 04:19:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:11,429 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:19:11,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:11,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:11,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:11,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 04:19:11,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:13,065 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 14 treesize of output 10 [2024-11-14 04:19:13,133 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 19 treesize of output 14 [2024-11-14 04:19:13,193 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 30 treesize of output 23 [2024-11-14 04:19:13,310 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 61 treesize of output 31 [2024-11-14 04:19:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:19:13,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:19:13,342 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:13,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776016866] [2024-11-14 04:19:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776016866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:19:13,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:19:13,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:19:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010588990] [2024-11-14 04:19:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:19:13,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:19:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:13,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:19:13,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:19:13,344 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:14,699 INFO L93 Difference]: Finished difference Result 240 states and 338 transitions. [2024-11-14 04:19:14,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:19:14,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-14 04:19:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:14,702 INFO L225 Difference]: With dead ends: 240 [2024-11-14 04:19:14,702 INFO L226 Difference]: Without dead ends: 142 [2024-11-14 04:19:14,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:19:14,703 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 265 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:19:14,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 332 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 04:19:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-14 04:19:14,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2024-11-14 04:19:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-14 04:19:14,717 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 108 [2024-11-14 04:19:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:14,717 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-14 04:19:14,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-14 04:19:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-14 04:19:14,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:14,720 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:14,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:14,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:14,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1861924892, now seen corresponding path program 1 times [2024-11-14 04:19:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:14,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406496695] [2024-11-14 04:19:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:14,922 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:19:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:14,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:14,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:15,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:19:15,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:19:15,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:19:15,337 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:15,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406496695] [2024-11-14 04:19:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406496695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:19:15,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:19:15,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:19:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525125504] [2024-11-14 04:19:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:19:15,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:19:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:19:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:19:15,339 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:15,412 INFO L93 Difference]: Finished difference Result 231 states and 324 transitions. [2024-11-14 04:19:15,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:19:15,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-14 04:19:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:15,416 INFO L225 Difference]: With dead ends: 231 [2024-11-14 04:19:15,418 INFO L226 Difference]: Without dead ends: 118 [2024-11-14 04:19:15,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:19:15,419 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:19:15,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:19:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-14 04:19:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-14 04:19:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 105 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-11-14 04:19:15,448 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 110 [2024-11-14 04:19:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-11-14 04:19:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-11-14 04:19:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-14 04:19:15,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:15,454 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:15,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-14 04:19:15,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:15,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1041437314, now seen corresponding path program 1 times [2024-11-14 04:19:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635337716] [2024-11-14 04:19:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:15,657 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:19:15,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:15,660 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:15,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 04:19:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:16,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:19:16,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:16,634 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:19:16,658 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 19 treesize of output 19 [2024-11-14 04:19:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:19:16,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:19:16,743 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:16,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635337716] [2024-11-14 04:19:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635337716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:19:16,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:19:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:19:16,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689598497] [2024-11-14 04:19:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:19:16,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:19:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:19:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:19:16,744 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:17,527 INFO L93 Difference]: Finished difference Result 231 states and 322 transitions. [2024-11-14 04:19:17,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:19:17,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-14 04:19:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:17,529 INFO L225 Difference]: With dead ends: 231 [2024-11-14 04:19:17,529 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 04:19:17,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:19:17,530 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 75 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:19:17,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 370 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:19:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 04:19:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2024-11-14 04:19:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-11-14 04:19:17,539 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 110 [2024-11-14 04:19:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:17,540 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-11-14 04:19:17,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-11-14 04:19:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-14 04:19:17,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:17,542 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:17,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 04:19:17,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:17,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1181322423, now seen corresponding path program 1 times [2024-11-14 04:19:17,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:17,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448251842] [2024-11-14 04:19:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:17,743 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:19:17,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:17,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:17,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:18,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 04:19:18,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:19,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:19:19,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-11-14 04:19:19,160 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 29 treesize of output 22 [2024-11-14 04:19:19,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:19:19,466 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 137 treesize of output 53 [2024-11-14 04:19:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:19:19,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:19:19,511 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:19,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448251842] [2024-11-14 04:19:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448251842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:19:19,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:19:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:19:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051260861] [2024-11-14 04:19:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:19:19,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:19:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:19:19,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:19:19,512 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:21,329 INFO L93 Difference]: Finished difference Result 236 states and 325 transitions. [2024-11-14 04:19:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:19:21,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-14 04:19:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:21,335 INFO L225 Difference]: With dead ends: 236 [2024-11-14 04:19:21,335 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 04:19:21,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:19:21,337 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 193 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:19:21,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 406 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 2 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 04:19:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 04:19:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-11-14 04:19:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2024-11-14 04:19:21,355 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 158 transitions. Word has length 112 [2024-11-14 04:19:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:21,355 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 158 transitions. [2024-11-14 04:19:21,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2024-11-14 04:19:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-14 04:19:21,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:21,358 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:21,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:21,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1143187741, now seen corresponding path program 1 times [2024-11-14 04:19:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:21,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223119499] [2024-11-14 04:19:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:21,560 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:19:21,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:21,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:21,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:21,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:19:21,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:22,775 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 14 treesize of output 10 [2024-11-14 04:19:22,829 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 19 treesize of output 14 [2024-11-14 04:19:22,872 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 19 treesize of output 14 [2024-11-14 04:19:22,991 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 43 treesize of output 25 [2024-11-14 04:19:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:19:23,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:19:23,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223119499] [2024-11-14 04:19:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223119499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:19:23,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:19:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 04:19:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785399186] [2024-11-14 04:19:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:19:23,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:19:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:19:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:19:23,060 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:24,163 INFO L93 Difference]: Finished difference Result 180 states and 234 transitions. [2024-11-14 04:19:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:19:24,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-14 04:19:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:24,165 INFO L225 Difference]: With dead ends: 180 [2024-11-14 04:19:24,165 INFO L226 Difference]: Without dead ends: 178 [2024-11-14 04:19:24,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:19:24,166 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 273 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:19:24,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 496 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 04:19:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-14 04:19:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-14 04:19:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 153 states have internal predecessors, (196), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:19:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2024-11-14 04:19:24,182 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 114 [2024-11-14 04:19:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:24,182 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2024-11-14 04:19:24,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:19:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2024-11-14 04:19:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 04:19:24,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:24,184 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:24,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:24,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:24,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:24,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash -155831984, now seen corresponding path program 1 times [2024-11-14 04:19:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391950003] [2024-11-14 04:19:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:24,386 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:19:24,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:24,387 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:24,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 04:19:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:24,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 04:19:24,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:25,888 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:19:26,371 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:19:26,791 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:19:26,950 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 114 treesize of output 87 [2024-11-14 04:19:27,105 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 114 treesize of output 87 [2024-11-14 04:19:27,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:19:27,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 58 [2024-11-14 04:19:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:19:27,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:19:28,154 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_249))) (or (not (let ((.cse1 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse6 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_250) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_251) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))) is different from false [2024-11-14 04:19:28,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:28,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391950003] [2024-11-14 04:19:28,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391950003] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:19:28,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [461356392] [2024-11-14 04:19:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:28,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:19:28,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:19:28,277 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:19:28,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-14 04:19:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:30,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 04:19:30,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:31,630 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:19:31,920 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:19:32,313 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:19:32,367 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 114 treesize of output 87 [2024-11-14 04:19:32,449 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 114 treesize of output 87 [2024-11-14 04:19:32,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:19:32,627 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 154 treesize of output 58 [2024-11-14 04:19:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:19:32,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:19:32,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_283) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:19:33,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_250 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_281))) (or (not (let ((.cse1 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse6 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_250) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_251) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))) is different from false [2024-11-14 04:19:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [461356392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:19:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826623918] [2024-11-14 04:19:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:33,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:19:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:19:33,443 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:19:33,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 04:19:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:33,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:19:33,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:35,379 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 68 treesize of output 32 [2024-11-14 04:19:36,322 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 117 treesize of output 90 [2024-11-14 04:19:36,936 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 117 treesize of output 90 [2024-11-14 04:19:37,290 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 162 treesize of output 123 [2024-11-14 04:19:37,514 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 108 treesize of output 81 [2024-11-14 04:19:37,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:19:37,832 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 148 treesize of output 58 [2024-11-14 04:19:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 28 proven. 96 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-14 04:19:38,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:19:38,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_314) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:19:38,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_250 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_312))) (or (not (let ((.cse1 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse6 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_250) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_251) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))) is different from false [2024-11-14 04:19:38,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826623918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:19:38,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:19:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 24 [2024-11-14 04:19:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251846624] [2024-11-14 04:19:38,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:19:38,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 04:19:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:19:38,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 04:19:38,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=755, Unknown=16, NotChecked=300, Total=1190 [2024-11-14 04:19:38,486 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-14 04:19:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:19:46,309 INFO L93 Difference]: Finished difference Result 744 states and 950 transitions. [2024-11-14 04:19:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 04:19:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2024-11-14 04:19:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:19:46,313 INFO L225 Difference]: With dead ends: 744 [2024-11-14 04:19:46,313 INFO L226 Difference]: Without dead ends: 581 [2024-11-14 04:19:46,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 397 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=286, Invalid=1693, Unknown=21, NotChecked=450, Total=2450 [2024-11-14 04:19:46,315 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 898 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:19:46,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1157 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-14 04:19:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-14 04:19:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 234. [2024-11-14 04:19:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 212 states have (on average 1.2547169811320755) internal successors, (266), 213 states have internal predecessors, (266), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 04:19:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 302 transitions. [2024-11-14 04:19:46,335 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 302 transitions. Word has length 115 [2024-11-14 04:19:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:19:46,335 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 302 transitions. [2024-11-14 04:19:46,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-14 04:19:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 302 transitions. [2024-11-14 04:19:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 04:19:46,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:46,337 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:46,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 04:19:46,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 04:19:46,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-14 04:19:46,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:19:46,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:46,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash 840497643, now seen corresponding path program 1 times [2024-11-14 04:19:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:19:46,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442611135] [2024-11-14 04:19:46,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:46,939 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:19:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:19:46,941 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:46,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:19:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:47,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:19:47,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:48,671 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:19:49,069 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:19:49,395 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 115 treesize of output 88 [2024-11-14 04:19:49,554 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 115 treesize of output 88 [2024-11-14 04:19:49,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:19:49,821 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 155 treesize of output 59 [2024-11-14 04:19:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:19:49,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:19:50,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_344) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:19:50,170 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_343) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_344) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:19:50,210 WARN L851 $PredicateComparison]: unable to prove that (or (fp.gt |c_ULTIMATE.start_step_#t~mem14#1| |c_ULTIMATE.start_step_#t~mem15#1|) (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_343) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_344) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:19:50,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_343) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_344) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse4 (select .cse5 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (select .cse5 .cse3))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))))) is different from false [2024-11-14 04:19:50,279 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_342))) (or (not (let ((.cse1 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_343) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_344) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse6 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))) is different from false [2024-11-14 04:19:50,388 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:19:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442611135] [2024-11-14 04:19:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442611135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:19:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1051764747] [2024-11-14 04:19:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:19:50,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:19:50,390 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:19:50,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-14 04:19:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:52,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 04:19:52,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:53,994 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:19:54,264 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:19:54,647 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:19:54,829 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 115 treesize of output 88 [2024-11-14 04:19:54,913 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 115 treesize of output 88 [2024-11-14 04:19:55,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:19:55,109 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 155 treesize of output 59 [2024-11-14 04:19:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:19:55,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:19:55,423 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_375) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_376) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:19:55,472 WARN L851 $PredicateComparison]: unable to prove that (or (fp.gt |c_ULTIMATE.start_step_#t~mem14#1| |c_ULTIMATE.start_step_#t~mem15#1|) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_375) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_376) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:19:55,713 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_374))) (or (not (let ((.cse1 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_375) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_376) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse6 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))) is different from false [2024-11-14 04:19:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1051764747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:19:55,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082366010] [2024-11-14 04:19:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:55,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:19:55,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:19:55,815 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:19:55,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 04:19:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:19:56,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:19:56,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:19:57,634 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 68 treesize of output 32 [2024-11-14 04:19:58,526 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 117 treesize of output 90 [2024-11-14 04:19:59,143 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 117 treesize of output 90 [2024-11-14 04:19:59,737 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 109 treesize of output 82 [2024-11-14 04:19:59,938 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 109 treesize of output 82 [2024-11-14 04:20:00,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:20:00,259 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 149 treesize of output 59 [2024-11-14 04:20:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 28 proven. 96 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-14 04:20:00,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:20:00,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_408) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:20:00,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_407) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_408) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:20:00,590 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_407) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_408) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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))))))) (fp.gt |c_ULTIMATE.start_step_#t~mem14#1| |c_ULTIMATE.start_step_#t~mem15#1|)) is different from false [2024-11-14 04:20:00,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_407) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_408) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) (let ((.cse5 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse4 (select .cse5 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (select .cse5 .cse3))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2024-11-14 04:20:00,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_406))) (or (let ((.cse1 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (not (let ((.cse6 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_407) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_408) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))))) is different from false [2024-11-14 04:20:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082366010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:00,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:20:00,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 26 [2024-11-14 04:20:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291996498] [2024-11-14 04:20:00,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:20:00,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 04:20:00,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:20:00,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 04:20:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=801, Unknown=30, NotChecked=910, Total=1892 [2024-11-14 04:20:00,805 INFO L87 Difference]: Start difference. First operand 234 states and 302 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 26 states have internal predecessors, (105), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-14 04:20:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:20:08,440 INFO L93 Difference]: Finished difference Result 812 states and 1030 transitions. [2024-11-14 04:20:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 04:20:08,441 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 26 states have internal predecessors, (105), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2024-11-14 04:20:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:20:08,444 INFO L225 Difference]: With dead ends: 812 [2024-11-14 04:20:08,444 INFO L226 Difference]: Without dead ends: 581 [2024-11-14 04:20:08,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 390 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=318, Invalid=1766, Unknown=38, NotChecked=1300, Total=3422 [2024-11-14 04:20:08,446 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 569 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:20:08,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1361 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-14 04:20:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-14 04:20:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 270. [2024-11-14 04:20:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 248 states have (on average 1.2419354838709677) internal successors, (308), 249 states have internal predecessors, (308), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 04:20:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 344 transitions. [2024-11-14 04:20:08,466 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 344 transitions. Word has length 115 [2024-11-14 04:20:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:20:08,466 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 344 transitions. [2024-11-14 04:20:08,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 26 states have internal predecessors, (105), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-14 04:20:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 344 transitions. [2024-11-14 04:20:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 04:20:08,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:20:08,468 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:08,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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)] Forceful destruction successful, exit code 0 [2024-11-14 04:20:08,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-14 04:20:08,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-14 04:20:09,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:20:09,069 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:20:09,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:20:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash -636912242, now seen corresponding path program 1 times [2024-11-14 04:20:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:20:09,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877916323] [2024-11-14 04:20:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:09,070 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:20:09,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:20:09,072 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:20:09,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-14 04:20:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:09,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:20:09,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:20:09,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:20:09,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:20:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877916323] [2024-11-14 04:20:09,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877916323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:20:09,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:20:09,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:20:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653278830] [2024-11-14 04:20:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:20:09,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:20:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:20:09,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:20:09,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:20:09,481 INFO L87 Difference]: Start difference. First operand 270 states and 344 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 04:20:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:20:09,521 INFO L93 Difference]: Finished difference Result 537 states and 685 transitions. [2024-11-14 04:20:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:20:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-14 04:20:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:20:09,524 INFO L225 Difference]: With dead ends: 537 [2024-11-14 04:20:09,524 INFO L226 Difference]: Without dead ends: 270 [2024-11-14 04:20:09,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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:20:09,525 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 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.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:20:09,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:20:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-14 04:20:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-14 04:20:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 248 states have (on average 1.2338709677419355) internal successors, (306), 249 states have internal predecessors, (306), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 04:20:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 342 transitions. [2024-11-14 04:20:09,542 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 342 transitions. Word has length 115 [2024-11-14 04:20:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:20:09,542 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 342 transitions. [2024-11-14 04:20:09,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 04:20:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 342 transitions. [2024-11-14 04:20:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-14 04:20:09,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:20:09,544 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-14 04:20:09,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:20:09,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:20:09,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:20:09,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1894591013, now seen corresponding path program 1 times [2024-11-14 04:20:09,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:20:09,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708043250] [2024-11-14 04:20:09,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:09,746 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:20:09,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:20:09,747 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:20:09,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-14 04:20:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:10,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:20:10,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:10,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:20:11,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 85 [2024-11-14 04:20:12,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:20:12,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 141 [2024-11-14 04:20:15,589 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 139 treesize of output 114 [2024-11-14 04:20:16,230 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 139 treesize of output 114 [2024-11-14 04:20:18,973 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 139 treesize of output 114 [2024-11-14 04:20:21,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:20:21,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 227 treesize of output 97 [2024-11-14 04:20:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 164 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-14 04:20:22,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:20:22,558 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:20:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708043250] [2024-11-14 04:20:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708043250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1327796357] [2024-11-14 04:20:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:20:22,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:20:22,560 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:20:22,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-14 04:20:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:24,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:20:24,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:25,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 04:20:27,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 63 [2024-11-14 04:20:42,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 77 [2024-11-14 04:20:43,232 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 113 treesize of output 82 [2024-11-14 04:20:43,726 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 113 treesize of output 82 [2024-11-14 04:20:48,368 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 113 treesize of output 82 [2024-11-14 04:20:51,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 79 [2024-11-14 04:20:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 164 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 04:20:53,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:20:53,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1327796357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:53,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034017919] [2024-11-14 04:20:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:53,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:20:53,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:20:53,748 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:20:53,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 04:20:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:54,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 04:20:54,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:55,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:20:55,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 47 [2024-11-14 04:21:10,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:10,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 142 treesize of output 89 [2024-11-14 04:21:17,337 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 95 [2024-11-14 04:21:17,706 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 95 [2024-11-14 04:21:26,369 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 95 [2024-11-14 04:21:37,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:37,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 208 treesize of output 82 [2024-11-14 04:21:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 164 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-14 04:21:41,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:21:41,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034017919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:41,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:21:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 37 [2024-11-14 04:21:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109825459] [2024-11-14 04:21:41,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:21:41,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 04:21:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:21:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 04:21:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1429, Unknown=51, NotChecked=0, Total=1640 [2024-11-14 04:21:41,715 INFO L87 Difference]: Start difference. First operand 270 states and 342 transitions. Second operand has 38 states, 38 states have (on average 4.5) internal successors, (171), 37 states have internal predecessors, (171), 16 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 16 states have call predecessors, (29), 16 states have call successors, (29) [2024-11-14 04:21:45,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:21:50,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:21:52,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:21:54,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:21:56,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:21:58,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:07,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:09,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:11,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:13,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:15,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:17,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:32,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:34,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:36,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:38,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:40,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:42,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:56,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:22:58,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:00,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:02,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:04,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:06,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:08,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:10,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:12,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:14,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:16,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:18,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:20,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:22,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:24,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:26,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:28,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:30,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:32,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:34,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:36,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:38,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:40,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:23:42,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:24:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:02,142 INFO L93 Difference]: Finished difference Result 780 states and 1006 transitions. [2024-11-14 04:24:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 04:24:02,144 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.5) internal successors, (171), 37 states have internal predecessors, (171), 16 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 16 states have call predecessors, (29), 16 states have call successors, (29) Word has length 116 [2024-11-14 04:24:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:02,146 INFO L225 Difference]: With dead ends: 780 [2024-11-14 04:24:02,146 INFO L226 Difference]: Without dead ends: 513 [2024-11-14 04:24:02,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 436 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 116.4s TimeCoverageRelationStatistics Valid=301, Invalid=2081, Unknown=68, NotChecked=0, Total=2450 [2024-11-14 04:24:02,148 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 869 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 223 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 101.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 2761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:02,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1716 Invalid, 2761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2496 Invalid, 42 Unknown, 0 Unchecked, 102.2s Time] [2024-11-14 04:24:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-14 04:24:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 394. [2024-11-14 04:24:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 346 states have (on average 1.2485549132947977) internal successors, (432), 349 states have internal predecessors, (432), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 04:24:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 508 transitions. [2024-11-14 04:24:02,199 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 508 transitions. Word has length 116 [2024-11-14 04:24:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:02,199 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 508 transitions. [2024-11-14 04:24:02,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.5) internal successors, (171), 37 states have internal predecessors, (171), 16 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 16 states have call predecessors, (29), 16 states have call successors, (29) [2024-11-14 04:24:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2024-11-14 04:24:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-14 04:24:02,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:02,205 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-14 04:24:02,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 04:24:02,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-14 04:24:02,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:24:02,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:02,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1055557351, now seen corresponding path program 1 times [2024-11-14 04:24:02,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:24:02,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548218806] [2024-11-14 04:24:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:02,808 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:24:02,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:24:02,809 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:24:02,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-14 04:24:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:03,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:24:03,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-14 04:24:03,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:03,182 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:24:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548218806] [2024-11-14 04:24:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548218806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:03,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:24:03,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160726428] [2024-11-14 04:24:03,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:03,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:24:03,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:24:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:24:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:24:03,187 INFO L87 Difference]: Start difference. First operand 394 states and 508 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 04:24:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:03,337 INFO L93 Difference]: Finished difference Result 787 states and 1016 transitions. [2024-11-14 04:24:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:24:03,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-11-14 04:24:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:03,340 INFO L225 Difference]: With dead ends: 787 [2024-11-14 04:24:03,340 INFO L226 Difference]: Without dead ends: 396 [2024-11-14 04:24:03,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 113 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:24:03,343 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 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:24:03,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-14 04:24:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-14 04:24:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 348 states have (on average 1.2442528735632183) internal successors, (433), 351 states have internal predecessors, (433), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 04:24:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 509 transitions. [2024-11-14 04:24:03,390 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 509 transitions. Word has length 116 [2024-11-14 04:24:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:03,391 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 509 transitions. [2024-11-14 04:24:03,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 04:24:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 509 transitions. [2024-11-14 04:24:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-14 04:24:03,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:03,395 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:03,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-14 04:24:03,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:24:03,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:03,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1814100061, now seen corresponding path program 1 times [2024-11-14 04:24:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:24:03,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441265433] [2024-11-14 04:24:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:03,600 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:24:03,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:24:03,602 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:24:03,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-14 04:24:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:03,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:24:03,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-14 04:24:03,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:03,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:24:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441265433] [2024-11-14 04:24:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441265433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:03,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:03,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:24:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373363082] [2024-11-14 04:24:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:24:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:24:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:24:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:24:03,937 INFO L87 Difference]: Start difference. First operand 396 states and 509 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 04:24:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:04,036 INFO L93 Difference]: Finished difference Result 789 states and 1015 transitions. [2024-11-14 04:24:04,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:24:04,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-11-14 04:24:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:04,041 INFO L225 Difference]: With dead ends: 789 [2024-11-14 04:24:04,041 INFO L226 Difference]: Without dead ends: 396 [2024-11-14 04:24:04,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 113 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:24:04,043 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 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:24:04,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-14 04:24:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-14 04:24:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 348 states have (on average 1.2413793103448276) internal successors, (432), 351 states have internal predecessors, (432), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 04:24:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 508 transitions. [2024-11-14 04:24:04,095 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 508 transitions. Word has length 116 [2024-11-14 04:24:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:04,095 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 508 transitions. [2024-11-14 04:24:04,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 04:24:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 508 transitions. [2024-11-14 04:24:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 04:24:04,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:04,098 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:04,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-14 04:24:04,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:24:04,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:04,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1552397602, now seen corresponding path program 1 times [2024-11-14 04:24:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:24:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008793052] [2024-11-14 04:24:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:04,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:24:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:24:04,302 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:24:04,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (22)] Waiting until timeout for monitored process [2024-11-14 04:24:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:04,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:24:04,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:05,436 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:24:06,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 57 [2024-11-14 04:24:07,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:07,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 238 treesize of output 125 [2024-11-14 04:24:10,333 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 231 treesize of output 178 [2024-11-14 04:24:10,981 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 231 treesize of output 178 [2024-11-14 04:24:13,720 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 231 treesize of output 178 [2024-11-14 04:24:14,730 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 231 treesize of output 178 [2024-11-14 04:24:16,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:16,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 243 treesize of output 148 [2024-11-14 04:24:25,416 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 251 treesize of output 194 [2024-11-14 04:24:34,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:34,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 339 treesize of output 123 [2024-11-14 04:24:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 156 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 04:24:34,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:35,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_628) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))))) is different from false [2024-11-14 04:24:35,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_181| (_ BitVec 64)) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_181|)) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_181|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_628) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))))) is different from false [2024-11-14 04:24:35,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_181| (_ BitVec 64)) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_626))) (store .cse3 |c_~#double_Array_0~0.base| (store (store (select .cse3 |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_181|)) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_181|)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_628) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))))) is different from false [2024-11-14 04:24:35,716 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:24:35,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008793052] [2024-11-14 04:24:35,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008793052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:35,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1384679611] [2024-11-14 04:24:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:35,716 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:24:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:24:35,720 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:24:35,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-14 04:24:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:38,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 04:24:38,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:39,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 04:24:41,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 71 [2024-11-14 04:24:54,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 89 [2024-11-14 04:25:07,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 129 treesize of output 94 [2024-11-14 04:25:07,820 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 129 treesize of output 94 [2024-11-14 04:25:18,767 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 129 treesize of output 94 [2024-11-14 04:25:20,017 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 129 treesize of output 94 [2024-11-14 04:25:28,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 92 [2024-11-14 04:25:36,858 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 129 treesize of output 94 [2024-11-14 04:25:41,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 87 [2024-11-14 04:25:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 156 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 04:25:44,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:25:44,486 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_669) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))))) is different from false [2024-11-14 04:25:44,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (_ BitVec 32)) (v_ArrVal_667 (_ BitVec 32)) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) v_ArrVal_667) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) v_ArrVal_668)) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_669) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))))) is different from false [2024-11-14 04:25:44,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (_ BitVec 32)) (v_ArrVal_667 (_ BitVec 32)) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_665))) (store .cse3 |c_~#double_Array_0~0.base| (store (store (select .cse3 |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) v_ArrVal_667) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) v_ArrVal_668))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_669) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))))) is different from false [2024-11-14 04:25:44,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1384679611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:25:44,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358829980] [2024-11-14 04:25:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:25:44,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:25:44,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:25:44,694 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:25:44,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 04:25:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:25:46,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 04:25:46,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:25:47,467 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 104 treesize of output 77 [2024-11-14 04:25:47,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:25:47,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 84 [2024-11-14 04:26:06,193 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 124 treesize of output 93 [2024-11-14 04:26:26,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:26:26,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 212 treesize of output 68 [2024-11-14 04:26:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:26:31,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:26:31,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358829980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:26:31,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:26:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16, 15] total 36 [2024-11-14 04:26:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525562168] [2024-11-14 04:26:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:26:31,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:26:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:26:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:26:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1261, Unknown=61, NotChecked=474, Total=1980 [2024-11-14 04:26:31,028 INFO L87 Difference]: Start difference. First operand 396 states and 508 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:26:35,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:37,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:45,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:47,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:49,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:51,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:53,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:55,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:57,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:26:59,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:01,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:03,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:05,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:07,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:09,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:11,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:13,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:15,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:17,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:19,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:21,342 INFO L93 Difference]: Finished difference Result 797 states and 1021 transitions. [2024-11-14 04:27:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:27:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 117 [2024-11-14 04:27:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:21,345 INFO L225 Difference]: With dead ends: 797 [2024-11-14 04:27:21,345 INFO L226 Difference]: Without dead ends: 404 [2024-11-14 04:27:21,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 133.1s TimeCoverageRelationStatistics Valid=214, Invalid=1468, Unknown=64, NotChecked=510, Total=2256 [2024-11-14 04:27:21,347 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 225 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:27:21,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 346 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 20 Unknown, 0 Unchecked, 43.8s Time] [2024-11-14 04:27:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-14 04:27:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2024-11-14 04:27:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 348 states have (on average 1.2385057471264367) internal successors, (431), 351 states have internal predecessors, (431), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 04:27:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2024-11-14 04:27:21,382 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 117 [2024-11-14 04:27:21,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:21,382 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2024-11-14 04:27:21,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:27:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2024-11-14 04:27:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 04:27:21,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:21,384 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:21,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (22)] Ended with exit code 0 [2024-11-14 04:27:21,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-14 04:27:21,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-14 04:27:21,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:27:21,985 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:27:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1923669162, now seen corresponding path program 1 times [2024-11-14 04:27:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:27:21,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034106836] [2024-11-14 04:27:21,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:21,986 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:27:21,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:27:21,990 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:27:21,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (25)] Waiting until timeout for monitored process [2024-11-14 04:27:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:22,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 04:27:22,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:23,582 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:27:24,324 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 67 treesize of output 52 [2024-11-14 04:27:24,811 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 67 treesize of output 52 [2024-11-14 04:27:25,023 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 112 treesize of output 85 [2024-11-14 04:27:25,237 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 112 treesize of output 85 [2024-11-14 04:27:25,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:27:25,563 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 152 treesize of output 56 [2024-11-14 04:27:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-14 04:27:25,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:26,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_728))) (or (not (let ((.cse1 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse6 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_729) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_730) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))) is different from false [2024-11-14 04:27:26,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:27:26,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034106836] [2024-11-14 04:27:26,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034106836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:26,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562281718] [2024-11-14 04:27:26,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:26,618 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:27:26,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:27:26,622 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:27:26,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-14 04:27:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:29,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:27:29,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:30,537 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:27:30,899 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 67 treesize of output 52 [2024-11-14 04:27:31,376 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 67 treesize of output 52 [2024-11-14 04:27:31,449 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 112 treesize of output 85 [2024-11-14 04:27:31,547 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 112 treesize of output 85 [2024-11-14 04:27:31,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:27:31,775 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 152 treesize of output 56 [2024-11-14 04:27:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-14 04:27:31,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:32,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_761) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:27:32,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_760 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_759))) (or (let ((.cse1 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_760) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_761) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (not (let ((.cse6 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))))) is different from false [2024-11-14 04:27:32,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1562281718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:32,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896797363] [2024-11-14 04:27:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:32,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:27:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:27:32,618 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:27:32,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 04:27:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:33,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 04:27:33,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:34,063 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 54 treesize of output 39 [2024-11-14 04:27:34,234 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 54 treesize of output 39 [2024-11-14 04:27:34,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:27:34,467 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 94 treesize of output 34 [2024-11-14 04:27:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:27:34,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:27:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896797363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:27:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:27:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 14] total 19 [2024-11-14 04:27:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376076428] [2024-11-14 04:27:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:27:34,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:27:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:27:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:27:34,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=523, Unknown=23, NotChecked=150, Total=812 [2024-11-14 04:27:34,591 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:27:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:36,932 INFO L93 Difference]: Finished difference Result 807 states and 1032 transitions. [2024-11-14 04:27:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:27:36,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 117 [2024-11-14 04:27:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:36,937 INFO L225 Difference]: With dead ends: 807 [2024-11-14 04:27:36,937 INFO L226 Difference]: Without dead ends: 414 [2024-11-14 04:27:36,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 379 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=140, Invalid=605, Unknown=23, NotChecked=162, Total=930 [2024-11-14 04:27:36,939 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 134 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:27:36,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 353 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-14 04:27:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-14 04:27:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 370. [2024-11-14 04:27:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 322 states have (on average 1.2515527950310559) internal successors, (403), 325 states have internal predecessors, (403), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 04:27:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 479 transitions. [2024-11-14 04:27:36,977 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 479 transitions. Word has length 117 [2024-11-14 04:27:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:36,978 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 479 transitions. [2024-11-14 04:27:36,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:27:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 479 transitions. [2024-11-14 04:27:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 04:27:36,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:36,980 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:36,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (25)] Ended with exit code 0 [2024-11-14 04:27:37,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-14 04:27:37,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 04:27:37,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:27:37,581 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:27:37,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1374968507, now seen corresponding path program 1 times [2024-11-14 04:27:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:27:37,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29786663] [2024-11-14 04:27:37,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:37,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:27:37,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:27:37,583 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:27:37,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (28)] Waiting until timeout for monitored process [2024-11-14 04:27:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:38,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 04:27:38,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:39,245 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:27:40,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 67 treesize of output 52 [2024-11-14 04:27:40,645 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 67 treesize of output 52 [2024-11-14 04:27:41,104 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 113 treesize of output 86 [2024-11-14 04:27:41,301 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 113 treesize of output 86 [2024-11-14 04:27:41,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:27:41,634 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 153 treesize of output 57 [2024-11-14 04:27:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-14 04:27:41,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:42,062 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_821) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:27:42,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_820) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_821) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:27:42,148 WARN L851 $PredicateComparison]: unable to prove that (or (fp.gt |c_ULTIMATE.start_step_#t~mem14#1| |c_ULTIMATE.start_step_#t~mem15#1|) (forall ((v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_820) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_821) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:27:42,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (forall ((v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_820) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_821) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) (let ((.cse5 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse4 (select .cse5 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (select .cse5 .cse3))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2024-11-14 04:27:42,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_819))) (or (let ((.cse1 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (not (let ((.cse6 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_820) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_821) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))))) is different from false [2024-11-14 04:27:42,377 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:27:42,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29786663] [2024-11-14 04:27:42,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29786663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:42,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1935976555] [2024-11-14 04:27:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:42,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:27:42,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:27:42,379 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:27:42,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-14 04:27:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:45,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:27:45,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:46,281 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:27:46,640 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 67 treesize of output 52 [2024-11-14 04:27:47,139 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 67 treesize of output 52 [2024-11-14 04:27:47,323 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 113 treesize of output 86 [2024-11-14 04:27:47,416 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 113 treesize of output 86 [2024-11-14 04:27:47,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:27:47,664 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 153 treesize of output 57 [2024-11-14 04:27:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-14 04:27:47,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:48,095 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_852 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_851) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_852) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:27:48,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (forall ((v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_852 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_851) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_852) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse4 (select .cse5 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (select .cse5 .cse3))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))))) is different from false [2024-11-14 04:27:48,434 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_852 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_850))) (or (not (let ((.cse1 (select (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_851) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_852) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 .cse3))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse6 (select .cse4 |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 .cse3))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))) is different from false [2024-11-14 04:27:48,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1935976555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:48,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189001444] [2024-11-14 04:27:48,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:48,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:27:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:27:48,558 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:27:48,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 04:27:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:48,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 04:27:48,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:50,838 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 44 treesize of output 20 [2024-11-14 04:27:52,698 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 62 treesize of output 47 [2024-11-14 04:27:53,220 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 62 treesize of output 47 [2024-11-14 04:27:53,498 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 62 treesize of output 47 [2024-11-14 04:27:53,698 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 62 treesize of output 47 [2024-11-14 04:27:54,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:27:54,033 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 102 treesize of output 42 [2024-11-14 04:27:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 102 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-14 04:27:54,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:54,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_852 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_883) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_852) |c_~#float_Array_0~0.base|))) (fp.gt (let ((.cse0 (select .cse1 |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:27:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189001444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:55,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:27:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 30 [2024-11-14 04:27:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551152701] [2024-11-14 04:27:55,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:27:55,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 04:27:55,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:27:55,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 04:27:55,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1100, Unknown=59, NotChecked=684, Total=1980 [2024-11-14 04:27:55,213 INFO L87 Difference]: Start difference. First operand 370 states and 479 transitions. Second operand has 31 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 28 states have internal predecessors, (114), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-14 04:28:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:28:11,729 INFO L93 Difference]: Finished difference Result 1447 states and 1801 transitions. [2024-11-14 04:28:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-14 04:28:11,730 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 28 states have internal predecessors, (114), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) Word has length 117 [2024-11-14 04:28:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:28:11,735 INFO L225 Difference]: With dead ends: 1447 [2024-11-14 04:28:11,735 INFO L226 Difference]: Without dead ends: 1054 [2024-11-14 04:28:11,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 394 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=770, Invalid=5346, Unknown=82, NotChecked=1458, Total=7656 [2024-11-14 04:28:11,738 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 852 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:28:11,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1681 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-11-14 04:28:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-11-14 04:28:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 464. [2024-11-14 04:28:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 388 states have (on average 1.2216494845360826) internal successors, (474), 395 states have internal predecessors, (474), 56 states have call successors, (56), 19 states have call predecessors, (56), 19 states have return successors, (56), 49 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-14 04:28:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 586 transitions. [2024-11-14 04:28:11,808 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 586 transitions. Word has length 117 [2024-11-14 04:28:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:28:11,809 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 586 transitions. [2024-11-14 04:28:11,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 28 states have internal predecessors, (114), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-14 04:28:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 586 transitions. [2024-11-14 04:28:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 04:28:11,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:28:11,811 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:11,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (28)] Ended with exit code 0 [2024-11-14 04:28:12,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 04:28:12,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-14 04:28:12,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:28:12,416 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:28:12,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:28:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash 147852805, now seen corresponding path program 1 times [2024-11-14 04:28:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:28:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683612341] [2024-11-14 04:28:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:12,417 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:28:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:28:12,418 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:28:12,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (31)] Waiting until timeout for monitored process [2024-11-14 04:28:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:12,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:28:12,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:28:12,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:28:12,820 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:28:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683612341] [2024-11-14 04:28:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683612341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:28:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:28:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:28:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786406895] [2024-11-14 04:28:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:28:12,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:28:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:28:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:28:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:28:12,821 INFO L87 Difference]: Start difference. First operand 464 states and 586 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 04:28:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:28:13,047 INFO L93 Difference]: Finished difference Result 859 states and 1076 transitions. [2024-11-14 04:28:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:28:13,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 117 [2024-11-14 04:28:13,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:28:13,049 INFO L225 Difference]: With dead ends: 859 [2024-11-14 04:28:13,049 INFO L226 Difference]: Without dead ends: 376 [2024-11-14 04:28:13,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:28:13,051 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:28:13,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 609 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:28:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-14 04:28:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 353. [2024-11-14 04:28:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.2133333333333334) internal successors, (364), 303 states have internal predecessors, (364), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-14 04:28:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 434 transitions. [2024-11-14 04:28:13,101 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 434 transitions. Word has length 117 [2024-11-14 04:28:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:28:13,101 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 434 transitions. [2024-11-14 04:28:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 04:28:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 434 transitions. [2024-11-14 04:28:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-14 04:28:13,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:28:13,103 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:13,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (31)] Ended with exit code 0 [2024-11-14 04:28:13,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:28:13,304 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:28:13,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:28:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1550034101, now seen corresponding path program 1 times [2024-11-14 04:28:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:28:13,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832120198] [2024-11-14 04:28:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:13,305 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:28:13,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:28:13,306 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:28:13,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (32)] Waiting until timeout for monitored process [2024-11-14 04:28:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:13,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 04:28:13,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:14,339 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:28:15,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:15,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 57 [2024-11-14 04:28:16,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:16,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 236 treesize of output 123 [2024-11-14 04:28:19,676 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 229 treesize of output 176 [2024-11-14 04:28:20,385 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 229 treesize of output 176 [2024-11-14 04:28:23,147 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 229 treesize of output 176 [2024-11-14 04:28:24,727 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 218 treesize of output 165 [2024-11-14 04:28:25,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:25,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 230 treesize of output 135 [2024-11-14 04:28:29,491 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 238 treesize of output 181 [2024-11-14 04:28:34,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:34,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 326 treesize of output 110 [2024-11-14 04:28:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 04:28:34,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:28:35,035 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_948) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-14 04:28:35,071 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_261| (_ BitVec 64))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_261|)) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_261|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_948) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-14 04:28:35,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_261| (_ BitVec 64))) (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_946))) (store .cse3 |c_~#double_Array_0~0.base| (store (store (select .cse3 |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_261|)) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_261|)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_948) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-14 04:28:35,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:28:35,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832120198] [2024-11-14 04:28:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832120198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:35,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [276367907] [2024-11-14 04:28:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:35,691 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:28:35,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:28:35,693 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:28:35,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-14 04:28:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:38,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 04:28:38,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:39,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 04:28:42,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 79 [2024-11-14 04:28:52,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 129 [2024-11-14 04:28:57,872 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 197 treesize of output 150 [2024-11-14 04:28:58,682 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 197 treesize of output 150 [2024-11-14 04:29:01,793 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 197 treesize of output 150 [2024-11-14 04:29:18,423 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 203 treesize of output 144 [2024-11-14 04:29:24,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 119 [2024-11-14 04:29:35,672 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 175 treesize of output 138 [2024-11-14 04:29:42,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 129 [2024-11-14 04:29:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 04:29:45,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:29:46,329 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (_ BitVec 32)) (v_ArrVal_987 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_271| (_ BitVec 64))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_271|)) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) v_ArrVal_986)) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_987) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-14 04:29:46,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_986 (_ BitVec 32)) (v_ArrVal_987 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_271| (_ BitVec 64))) (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_984))) (store .cse3 |c_~#double_Array_0~0.base| (store (store (select .cse3 |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_271|)) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) v_ArrVal_986))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_987) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse2 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-14 04:29:47,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [276367907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:29:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927075618] [2024-11-14 04:29:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:29:47,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:29:47,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:29:47,150 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:29:47,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-14 04:29:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:29:47,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 04:29:47,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:29:49,349 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 76 [2024-11-14 04:29:49,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:29:49,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 73 [2024-11-14 04:30:04,173 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 113 treesize of output 84 [2024-11-14 04:30:20,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:30:20,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 201 treesize of output 63 [2024-11-14 04:30:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:30:25,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:30:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927075618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:25,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:30:25,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [21, 21] total 48 [2024-11-14 04:30:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538433339] [2024-11-14 04:30:25,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:25,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:30:25,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:30:25,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:30:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2658, Unknown=101, NotChecked=560, Total=3660 [2024-11-14 04:30:25,375 INFO L87 Difference]: Start difference. First operand 353 states and 434 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:30:29,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:31,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:33,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:35,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:37,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:39,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:41,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:43,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:45,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:47,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:49,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:30:51,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:53,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:55,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:57,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:59,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:01,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:04,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:06,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:08,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:10,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:12,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:14,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:16,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:18,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:20,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:22,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:24,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:26,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:31:27,253 INFO L93 Difference]: Finished difference Result 711 states and 873 transitions. [2024-11-14 04:31:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:31:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 118 [2024-11-14 04:31:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:31:27,256 INFO L225 Difference]: With dead ends: 711 [2024-11-14 04:31:27,256 INFO L226 Difference]: Without dead ends: 361 [2024-11-14 04:31:27,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 112.1s TimeCoverageRelationStatistics Valid=370, Invalid=2854, Unknown=102, NotChecked=580, Total=3906 [2024-11-14 04:31:27,258 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 172 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 8 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:31:27,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 450 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 496 Invalid, 28 Unknown, 0 Unchecked, 61.5s Time] [2024-11-14 04:31:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-14 04:31:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 353. [2024-11-14 04:31:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.21) internal successors, (363), 303 states have internal predecessors, (363), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-14 04:31:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2024-11-14 04:31:27,306 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 118 [2024-11-14 04:31:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:31:27,306 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2024-11-14 04:31:27,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:31:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2024-11-14 04:31:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-14 04:31:27,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:27,308 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:27,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (32)] Ended with exit code 0 [2024-11-14 04:31:27,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-14 04:31:27,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-14 04:31:27,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:31:27,909 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:31:27,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:27,909 INFO L85 PathProgramCache]: Analyzing trace with hash -364165220, now seen corresponding path program 1 times [2024-11-14 04:31:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628050753] [2024-11-14 04:31:27,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:27,910 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:31:27,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:27,911 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:31:27,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (35)] Waiting until timeout for monitored process [2024-11-14 04:31:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:28,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 04:31:28,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:29,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-11-14 04:31:30,380 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 131 treesize of output 102 [2024-11-14 04:31:30,810 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 131 treesize of output 102 [2024-11-14 04:31:31,247 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 131 treesize of output 102 [2024-11-14 04:31:31,885 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 131 treesize of output 102 [2024-11-14 04:31:32,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:31:32,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 104 [2024-11-14 04:31:32,541 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 208 treesize of output 163 [2024-11-14 04:31:33,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:31:33,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 302 treesize of output 104 [2024-11-14 04:31:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:31:33,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:31:34,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_288| (_ BitVec 64))) (or (let ((.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_288|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_288|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1052) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (concat (select .cse1 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_288|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_288|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_288|)) |c_ULTIMATE.start_step_#t~ite28#1|)))) is different from false [2024-11-14 04:31:34,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_288| (_ BitVec 64))) (let ((.cse5 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse6 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse7 .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_288|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_288|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1052) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (concat (select .cse1 .cse5) (select .cse1 .cse6)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse5) (select .cse7 .cse6)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_288|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_288|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_288|))))))) is different from false [2024-11-14 04:31:34,861 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_288| (_ BitVec 64)) (v_ArrVal_1049 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1049))) (let ((.cse2 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select .cse9 |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_288|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_288|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_288|)))) (let ((.cse7 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse6 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse9 |c_~#double_Array_0~0.base| (store (store .cse1 .cse7 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_288|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_288|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1052) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 .cse7)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))))) is different from false [2024-11-14 04:31:35,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:31:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628050753] [2024-11-14 04:31:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628050753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:31:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1283004187] [2024-11-14 04:31:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:35,028 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:31:35,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:31:35,030 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:31:35,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-14 04:31:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:39,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 04:31:39,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:40,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 04:31:43,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 79 [2024-11-14 04:31:46,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 93 [2024-11-14 04:31:49,177 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 225 treesize of output 164 [2024-11-14 04:31:50,266 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 225 treesize of output 164 [2024-11-14 04:31:51,570 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 225 treesize of output 164 [2024-11-14 04:31:53,213 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 225 treesize of output 164 [2024-11-14 04:31:56,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 194 [2024-11-14 04:31:57,243 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 268 treesize of output 203 [2024-11-14 04:32:01,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 452 treesize of output 208 [2024-11-14 04:32:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 04:32:01,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:32:04,328 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem124#1| (_ FloatingPoint 11 53)) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1091) |c_~#double_Array_0~0.base|))) (let ((.cse2 (let ((.cse5 (concat (select .cse1 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5)))) (.cse3 (let ((.cse4 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (or (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse2) (not (fp.gt .cse3 |ULTIMATE.start_property_#t~mem124#1|)) (not (fp.gt .cse2 .cse3)))))) is different from false [2024-11-14 04:32:04,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_299| (_ BitVec 64)) (|ULTIMATE.start_property_#t~mem124#1| (_ FloatingPoint 11 53)) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_299|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_299|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1091) |c_~#double_Array_0~0.base|))) (let ((.cse4 (let ((.cse7 (concat (select .cse1 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))) (.cse5 (let ((.cse6 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (or (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse4) (not (fp.gt .cse5 |ULTIMATE.start_property_#t~mem124#1|)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_299|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_299|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_299|)) |c_ULTIMATE.start_step_#t~ite28#1|)) (not (fp.gt .cse4 .cse5))))))) is different from false [2024-11-14 04:32:08,282 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_299| (_ BitVec 64)) (v_ArrVal_1088 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem124#1| (_ FloatingPoint 11 53)) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1088))) (let ((.cse9 (select .cse17 |c_~#double_Array_0~0.base|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse11 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (.cse13 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store (store .cse17 |c_~#double_Array_0~0.base| (store (store .cse9 .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_299|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_299|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1091) |c_~#double_Array_0~0.base|)) (.cse14 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))) (let ((.cse4 (let ((.cse16 (concat (select .cse1 .cse13) (select .cse1 .cse14)))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16)))) (.cse5 (let ((.cse15 (concat (select .cse1 .cse11) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15)))) (.cse6 (let ((.cse12 (concat (select .cse9 .cse13) (select .cse9 .cse14)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) (.cse7 (let ((.cse10 (concat (select .cse9 .cse11) (select .cse9 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (or (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse4) (not (fp.gt .cse4 .cse5)) (not (fp.gt .cse5 |ULTIMATE.start_property_#t~mem124#1|)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_299|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_299|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_299|)) .cse6)) (not (fp.gt .cse6 .cse7)) (not (fp.gt .cse7 (let ((.cse8 (concat (select .cse9 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse9 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))))) is different from false [2024-11-14 04:32:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1283004187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:32:09,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931930843] [2024-11-14 04:32:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:32:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:32:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:32:09,577 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:32:09,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-14 04:32:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:32:10,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:32:10,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:32:12,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:12,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 75 [2024-11-14 04:32:14,115 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 137 treesize of output 106 [2024-11-14 04:32:15,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:15,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 75 [2024-11-14 04:32:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-14 04:32:21,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:32:21,776 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_307| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_307|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_307|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_307|)) |c_ULTIMATE.start_step_#t~ite28#1|)) (let ((.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_307|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_307|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1052) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (concat (select .cse1 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))))) is different from false [2024-11-14 04:32:21,820 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_307| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_307|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_307|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_307|)))) (let ((.cse7 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse6 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 .cse7 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_307|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_307|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1052) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 .cse7)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) (forall ((|ULTIMATE.start_step_#t~ite20#1| (_ FloatingPoint 11 53))) (not (fp.gt |c_ULTIMATE.start_step_#t~mem21#1| |ULTIMATE.start_step_#t~ite20#1|)))) is different from false [2024-11-14 04:32:21,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:21,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 450 treesize of output 216 [2024-11-14 04:32:21,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:21,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 316 treesize of output 160 [2024-11-14 04:32:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 04:32:22,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931930843] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 04:32:22,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:32:22,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16, 24, 13] total 54 [2024-11-14 04:32:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271560542] [2024-11-14 04:32:22,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:32:22,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:32:22,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:32:22,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:32:22,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=2903, Unknown=32, NotChecked=952, Total=4290 [2024-11-14 04:32:22,620 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:32:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:32:31,442 INFO L93 Difference]: Finished difference Result 775 states and 949 transitions. [2024-11-14 04:32:31,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:32:31,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 118 [2024-11-14 04:32:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:32:31,446 INFO L225 Difference]: With dead ends: 775 [2024-11-14 04:32:31,447 INFO L226 Difference]: Without dead ends: 425 [2024-11-14 04:32:31,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 471 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=513, Invalid=3754, Unknown=187, NotChecked=1096, Total=5550 [2024-11-14 04:32:31,449 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 178 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 1 mSolverCounterUnsat, 113 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 113 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:32:31,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 647 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 510 Invalid, 113 Unknown, 373 Unchecked, 3.7s Time] [2024-11-14 04:32:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-14 04:32:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 389. [2024-11-14 04:32:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 336 states have (on average 1.2053571428571428) internal successors, (405), 339 states have internal predecessors, (405), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-14 04:32:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 475 transitions. [2024-11-14 04:32:31,500 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 475 transitions. Word has length 118 [2024-11-14 04:32:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:32:31,501 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 475 transitions. [2024-11-14 04:32:31,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:32:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 475 transitions. [2024-11-14 04:32:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-14 04:32:31,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:32:31,503 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:31,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-11-14 04:32:31,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (35)] Ended with exit code 0 [2024-11-14 04:32:31,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2024-11-14 04:32:32,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:32:32,104 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:32:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:32:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash -302125606, now seen corresponding path program 1 times [2024-11-14 04:32:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:32:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949781756] [2024-11-14 04:32:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:32:32,105 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:32:32,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:32:32,106 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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:32:32,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/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 (38)] Waiting until timeout for monitored process [2024-11-14 04:32:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:32:32,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 04:32:32,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:32:34,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-11-14 04:32:35,101 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 141 treesize of output 110 [2024-11-14 04:32:35,647 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 141 treesize of output 110 [2024-11-14 04:32:36,215 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 141 treesize of output 110 [2024-11-14 04:32:37,033 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 141 treesize of output 110 [2024-11-14 04:32:37,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:37,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 123 [2024-11-14 04:32:38,283 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 209 treesize of output 174 [2024-11-14 04:32:40,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:40,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 303 treesize of output 135 [2024-11-14 04:32:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:32:40,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:32:42,394 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_316| (_ BitVec 64))) (or (let ((.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_316|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_316|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1154) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (concat (select .cse1 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_316|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_316|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_316|)) |c_ULTIMATE.start_step_#t~ite28#1|)))) is different from false [2024-11-14 04:32:42,448 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~ite20#1| (_ FloatingPoint 11 53))) (not (fp.gt |c_ULTIMATE.start_step_#t~mem21#1| |ULTIMATE.start_step_#t~ite20#1|))) (forall ((v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_316| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_316|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_316|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_316|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse7 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse6 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 .cse7 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_316|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_316|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1154) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 .cse7)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))))) is different from false [2024-11-14 04:32:42,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (.cse8 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse7 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))) (let ((.cse0 (let ((.cse9 (concat (select .cse8 .cse6) (select .cse8 .cse7)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (or (forall ((|ULTIMATE.start_step_#t~ite20#1| (_ FloatingPoint 11 53))) (not (fp.gt .cse0 |ULTIMATE.start_step_#t~ite20#1|))) (forall ((v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_316| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_316|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_316|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_316|)) .cse0)) (let ((.cse4 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse8 .cse4 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_316|)) .cse3 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_316|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1154) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse1 (concat (select .cse2 .cse3) (select .cse2 .cse4)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) (let ((.cse5 (concat (select .cse2 .cse6) (select .cse2 .cse7)))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))))))))) is different from false [2024-11-14 04:32:42,705 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite20#1| (_ FloatingPoint 11 53)) (|v_skolemized_q#valueAsBitvector_316| (_ BitVec 64))) (let ((.cse7 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1150))) (let ((.cse5 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (.cse8 (select .cse7 |c_~#double_Array_0~0.base|)) (.cse6 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))) (let ((.cse9 (let ((.cse10 (concat (select .cse8 .cse5) (select .cse8 .cse6)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (or (let ((.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse7 |c_~#double_Array_0~0.base| (store (store .cse8 .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_316|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_316|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1154) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (concat (select .cse1 .cse5) (select .cse1 .cse6)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_316|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_316|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_316|)) .cse9)) (not (fp.gt .cse9 |ULTIMATE.start_step_#t~ite20#1|))))))) is different from false [2024-11-14 04:32:43,062 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:32:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949781756] [2024-11-14 04:32:43,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949781756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:32:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2118563389] [2024-11-14 04:32:43,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:32:43,063 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:32:43,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:32:43,067 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:32:43,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-14 04:32:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:32:48,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 04:32:48,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:32:49,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 04:32:52,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 79 [2024-11-14 04:32:56,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 133 [2024-11-14 04:33:12,179 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 225 treesize of output 164 [2024-11-14 04:33:13,290 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 225 treesize of output 164 [2024-11-14 04:33:18,747 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 225 treesize of output 164 [2024-11-14 04:33:20,530 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 225 treesize of output 164 [2024-11-14 04:33:28,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 174 [2024-11-14 04:33:33,556 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 268 treesize of output 203 [2024-11-14 04:33:38,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 413 treesize of output 193 [2024-11-14 04:33:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 04:33:38,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:33:42,212 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_327| (_ BitVec 64)) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_327|)) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_327|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1192) |c_~#double_Array_0~0.base|))) (let ((.cse2 (let ((.cse4 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (or (not (fp.gt (let ((.cse0 (concat (select .cse1 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse2)) (not (fp.gt .cse2 (let ((.cse3 (concat (select .cse1 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))))))) is different from false [2024-11-14 04:33:46,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_327| (_ BitVec 64)) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1190))) (let ((.cse1 (select .cse15 |c_~#double_Array_0~0.base|))) (let ((.cse11 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store (store .cse15 |c_~#double_Array_0~0.base| (store (store .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_327|)) (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_327|))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1192) |c_~#double_Array_0~0.base|)) (.cse8 (bvadd (_ bv20 32) |c_~#double_Array_0~0.offset|)) (.cse9 (bvadd (_ bv16 32) |c_~#double_Array_0~0.offset|))) (let ((.cse4 (let ((.cse14 (concat (select .cse1 .cse8) (select .cse1 .cse9)))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14)))) (.cse2 (bvadd (_ bv28 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv24 32) |c_~#double_Array_0~0.offset|)) (.cse5 (let ((.cse13 (concat (select .cse7 .cse11) (select .cse7 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (or (not (fp.gt (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse4)) (not (fp.gt .cse5 (let ((.cse6 (concat (select .cse7 .cse8) (select .cse7 .cse9)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.gt (let ((.cse10 (concat (select .cse1 .cse11) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) .cse4) (not (fp.gt (let ((.cse12 (concat (select .cse7 .cse2) (select .cse7 .cse3)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) .cse5)))))))) is different from false [2024-11-14 04:33:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2118563389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:33:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641205544] [2024-11-14 04:33:47,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:33:47,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:33:47,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:33:47,264 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:33:47,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c19c85-d3a9-4d2a-8b12-22ebf0462a4d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-14 04:33:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:33:47,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 04:33:47,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:33:49,516 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 104 treesize of output 77 [2024-11-14 04:33:52,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:33:52,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 261 treesize of output 127